結果
問題 | No.973 余興 |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-01-17 21:58:43 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 522 ms / 4,000 ms |
コード長 | 3,691 bytes |
コンパイル時間 | 643 ms |
コンパイル使用メモリ | 107,408 KB |
実行使用メモリ | 205,620 KB |
最終ジャッジ日時 | 2023-09-04 04:43:34 |
合計ジャッジ時間 | 19,327 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 493 ms
204,940 KB |
testcase_01 | AC | 493 ms
204,692 KB |
testcase_02 | AC | 478 ms
204,504 KB |
testcase_03 | AC | 480 ms
205,620 KB |
testcase_04 | AC | 509 ms
204,872 KB |
testcase_05 | AC | 493 ms
205,448 KB |
testcase_06 | AC | 496 ms
204,976 KB |
testcase_07 | AC | 507 ms
204,896 KB |
testcase_08 | AC | 474 ms
204,856 KB |
testcase_09 | AC | 481 ms
205,584 KB |
testcase_10 | AC | 458 ms
200,608 KB |
testcase_11 | AC | 134 ms
77,336 KB |
testcase_12 | AC | 139 ms
76,352 KB |
testcase_13 | AC | 143 ms
76,008 KB |
testcase_14 | AC | 136 ms
76,836 KB |
testcase_15 | AC | 19 ms
11,308 KB |
testcase_16 | AC | 20 ms
11,364 KB |
testcase_17 | AC | 12 ms
10,204 KB |
testcase_18 | AC | 16 ms
10,492 KB |
testcase_19 | AC | 15 ms
10,504 KB |
testcase_20 | AC | 11 ms
9,552 KB |
testcase_21 | AC | 20 ms
11,408 KB |
testcase_22 | AC | 19 ms
11,224 KB |
testcase_23 | AC | 15 ms
10,524 KB |
testcase_24 | AC | 15 ms
10,372 KB |
testcase_25 | AC | 8 ms
8,012 KB |
testcase_26 | AC | 12 ms
9,748 KB |
testcase_27 | AC | 26 ms
20,984 KB |
testcase_28 | AC | 14 ms
10,436 KB |
testcase_29 | AC | 14 ms
10,360 KB |
testcase_30 | AC | 485 ms
204,480 KB |
testcase_31 | AC | 507 ms
204,788 KB |
testcase_32 | AC | 521 ms
204,996 KB |
testcase_33 | AC | 522 ms
204,512 KB |
testcase_34 | AC | 503 ms
204,684 KB |
testcase_35 | AC | 512 ms
204,320 KB |
testcase_36 | AC | 467 ms
202,508 KB |
testcase_37 | AC | 504 ms
201,812 KB |
testcase_38 | AC | 501 ms
205,016 KB |
testcase_39 | AC | 483 ms
204,740 KB |
testcase_40 | AC | 1 ms
4,376 KB |
testcase_41 | AC | 2 ms
4,376 KB |
testcase_42 | AC | 2 ms
4,380 KB |
testcase_43 | AC | 1 ms
4,376 KB |
testcase_44 | AC | 1 ms
4,376 KB |
testcase_45 | AC | 2 ms
4,376 KB |
testcase_46 | AC | 494 ms
204,664 KB |
testcase_47 | AC | 458 ms
204,480 KB |
testcase_48 | AC | 479 ms
204,596 KB |
testcase_49 | AC | 442 ms
196,536 KB |
testcase_50 | AC | 483 ms
203,676 KB |
testcase_51 | AC | 485 ms
204,456 KB |
testcase_52 | AC | 508 ms
204,824 KB |
testcase_53 | AC | 499 ms
202,896 KB |
testcase_54 | AC | 492 ms
204,728 KB |
testcase_55 | AC | 510 ms
205,420 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 X = readLong(); auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong(); } auto ASum = new long[N + 1]; foreach (i; 0 .. N) { ASum[i + 1] = ASum[i] + A[i]; } auto ls = new int[N + 1]; auto rs = new int[N + 1]; foreach (i; 0 .. N + 1) { ls[i] = ASum.upperBound(ASum[i] + X); rs[i] = ASum.lowerBound(ASum[i] - X); } debug { writeln("A = ", A); writeln("ls = ", ls); writeln("rs = ", rs); } auto dp0 = new int[][](N + 1, N + 2); auto dp1 = new int[][](N + 1, N + 2); bool check0(int i, int ja, int jb) { return (dp0[i][jb] - dp0[i][ja] < jb - ja); } bool check1(int j, int ia, int ib) { return (dp1[j][ia] - dp1[j][ib] < ib - ia); } foreach (w; 2 .. N + 1) { foreach (i; 0 .. N - w + 1) { const j = i + w; int x = 0; // eat [i, i + 1), ..., [i, ls[i] - 1) if (check1(j, i + 1, min(ls[i], j))) { x = 1; } // eat [rs[j], j), ..., [j - 1, j) if (check0(i, max(rs[j], i + 1), j)) { x = 1; } debug { writeln(i, " ", j, ": ", x); } dp0[i][j + 1] = dp0[i][j] + x; dp1[j][i] = dp1[j][i + 1] + x; } } debug { auto brt = new int[][](N + 1, N + 1); foreach (w; 2 .. N + 1) { foreach (i; 0 .. N - w + 1) { const j = i + w; foreach (k; i + 1 .. j) { if (ASum[k] - ASum[i] <= X) { if (!brt[k][j]) { brt[i][j] = 1; } } } foreach (k; i + 1 .. j) { if (ASum[j] - ASum[k] <= X) { if (!brt[i][k]) { brt[i][j] = 1; } } } } } foreach (i; 0 .. N + 1) { writeln(i, ": ", brt[i][i + 1 .. $]); } foreach (i; 0 .. N + 1) foreach (j; i + 1 .. N + 1) { if (brt[i][j] != dp0[i][j + 1] - dp0[i][j]) { writeln(i, " ", j, ": ", brt[i][j], " ", dp0[i][j + 1] - dp0[i][j]); assert(false); } } } const ans = dp0[0][N + 1] - dp0[0][N]; writeln(ans ? "A" : "B"); } } catch (EOFException e) { } }