結果
問題 | No.2169 To Arithmetic |
ユーザー | 👑 hos.lyric |
提出日時 | 2022-12-28 02:07:10 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 316 ms / 2,000 ms |
コード長 | 3,113 bytes |
コンパイル時間 | 1,021 ms |
コンパイル使用メモリ | 121,140 KB |
実行使用メモリ | 19,612 KB |
最終ジャッジ日時 | 2023-09-04 19:29:51 |
合計ジャッジ時間 | 11,363 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 5 ms
4,376 KB |
testcase_05 | AC | 3 ms
4,380 KB |
testcase_06 | AC | 4 ms
4,376 KB |
testcase_07 | AC | 5 ms
4,380 KB |
testcase_08 | AC | 3 ms
4,380 KB |
testcase_09 | AC | 94 ms
7,228 KB |
testcase_10 | AC | 90 ms
12,600 KB |
testcase_11 | AC | 167 ms
12,548 KB |
testcase_12 | AC | 55 ms
13,948 KB |
testcase_13 | AC | 170 ms
14,916 KB |
testcase_14 | AC | 93 ms
8,768 KB |
testcase_15 | AC | 65 ms
14,412 KB |
testcase_16 | AC | 98 ms
10,312 KB |
testcase_17 | AC | 232 ms
13,460 KB |
testcase_18 | AC | 113 ms
8,196 KB |
testcase_19 | AC | 316 ms
19,040 KB |
testcase_20 | AC | 316 ms
19,372 KB |
testcase_21 | AC | 314 ms
19,548 KB |
testcase_22 | AC | 315 ms
19,608 KB |
testcase_23 | AC | 314 ms
19,612 KB |
testcase_24 | AC | 267 ms
19,256 KB |
testcase_25 | AC | 254 ms
13,216 KB |
testcase_26 | AC | 278 ms
19,020 KB |
testcase_27 | AC | 291 ms
19,304 KB |
ソースコード
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 main() { try { for (; ; ) { const N = readInt; const Q = readInt; auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong; } auto D = new long[Q]; foreach (q; 0 .. Q) { D[q] = readLong; } // max_i (A[i] - d i) int len; auto que = new int[N]; foreach (i; 0 .. N) { for (; len >= 2; ) { const i2 = que[len - 2]; const i1 = que[len - 1]; if ((i1 - i2) * (A[i] - A[i1]) - (A[i1] - A[i2]) * (i - i1) >= 0) { --len; } else { break; } } que[len++] = i; } debug { writeln("que = ", que[0 .. len]); } /* A[i] - d i < A[i+1] - d (i+1) <=> A[i+1] - A[i] > d */ auto bs = new long[N - 1]; foreach (i; 0 .. N - 1) { bs[i] = A[i + 1] - A[i]; } bs.sort; auto bsSum = new long[N]; foreach (i; 0 .. N - 1) { bsSum[i + 1] = bsSum[i] + bs[i]; } alias DQ = Tuple!(long, "d", int, "q"); auto dqs = new DQ[Q]; foreach (q; 0 .. Q) { dqs[q] = DQ(D[q], q); } dqs.sort; auto ans = new long[Q]; foreach (ref dq; dqs) { const d = dq.d, q = dq.q; for (; len >= 2; ) { const i2 = que[len - 2]; const i1 = que[len - 1]; if (A[i2] - d * i2 >= A[i1] - d * i1) { --len; } else { break; } } const i1 = que[len - 1]; const mx = A[i1] - d * i1; ans[q] += (mx - (A[N - 1] - d * (N - 1))); const pos = bs.lowerBound(d); ans[q] += (bsSum[N - 1] - bsSum[pos]) - d * ((N - 1) - pos); } foreach (q; 0 .. Q) { writeln(ans[q]); } debug { writeln("========"); } } } catch (EOFException e) { } }