結果
問題 | No.2065 Sum of Min |
ユーザー |
👑 |
提出日時 | 2022-09-02 22:46:29 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 221 ms / 2,000 ms |
コード長 | 2,828 bytes |
コンパイル時間 | 1,186 ms |
コンパイル使用メモリ | 132,808 KB |
実行使用メモリ | 25,748 KB |
最終ジャッジ日時 | 2024-06-22 16:11:42 |
合計ジャッジ時間 | 8,359 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;import core.bitop;class EOFException : Throwable { this() { super("EOF"); } }string[] tokens;string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }int readInt() { return readToken.to!int; }long readLong() { return readToken.to!long; }real readReal() { return readToken.to!real; }bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1;(unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }void bAdd(T)(T[] bit, int pos, T val)in {assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");}do {for (int x = pos; x < bit.length; x |= x + 1) {bit[x] += val;}}// sum of [0, pos)T bSum(T)(T[] bit, int pos)in {assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");}do {T ret = 0;for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {ret += bit[x];}return ret;}void main() {try {for (; ; ) {const N = readInt;const Q = readInt;auto A = new long[N];foreach (i; 0 .. N) {A[i] = readLong;}auto L = new int[Q];auto R = new int[Q];auto X = new long[Q];foreach (q; 0 .. Q) {L[q] = readInt - 1;R[q] = readInt;X[q] = readLong;}alias Entry = Tuple!(long, "val", int, "key");Entry[] es;foreach (i; 0 .. N) {es ~= Entry(A[i], i);}foreach (q; 0 .. Q) {es ~= Entry(X[q], N + q);}es.sort;auto ans = new long[Q];auto bit0 = new long[N];auto bit1 = new long[N];foreach (ref e; es) {if (e.key < N) {const i = e.key;bit0.bAdd(i, 1);bit1.bAdd(i, A[i]);} else {const q = e.key - N;const sum0 = bit0.bSum(R[q]) - bit0.bSum(L[q]);const sum1 = bit1.bSum(R[q]) - bit1.bSum(L[q]);ans[q] += sum1;ans[q] += ((R[q] - L[q]) - sum0) * X[q];}}foreach (q; 0 .. Q) {writeln(ans[q]);}}} catch (EOFException e) {}}