結果
問題 | No.2592 おでぶなおばけさん 2 |
ユーザー | 👑 hos.lyric |
提出日時 | 2023-12-20 00:11:28 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,329 bytes |
コンパイル時間 | 2,876 ms |
コンパイル使用メモリ | 108,416 KB |
実行使用メモリ | 22,088 KB |
最終ジャッジ日時 | 2023-12-20 01:12:42 |
合計ジャッジ時間 | 39,466 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,676 KB |
testcase_01 | AC | 107 ms
12,912 KB |
testcase_02 | AC | 152 ms
10,896 KB |
testcase_03 | AC | 62 ms
6,676 KB |
testcase_04 | AC | 72 ms
6,676 KB |
testcase_05 | AC | 265 ms
21,384 KB |
testcase_06 | AC | 158 ms
10,956 KB |
testcase_07 | AC | 250 ms
10,968 KB |
testcase_08 | AC | 208 ms
12,760 KB |
testcase_09 | AC | 71 ms
6,676 KB |
testcase_10 | AC | 96 ms
6,676 KB |
testcase_11 | AC | 195 ms
12,936 KB |
testcase_12 | AC | 42 ms
6,676 KB |
testcase_13 | AC | 391 ms
14,688 KB |
testcase_14 | AC | 394 ms
14,868 KB |
testcase_15 | AC | 299 ms
12,832 KB |
testcase_16 | AC | 443 ms
14,844 KB |
testcase_17 | AC | 396 ms
17,644 KB |
testcase_18 | AC | 289 ms
12,864 KB |
testcase_19 | AC | 317 ms
10,828 KB |
testcase_20 | AC | 298 ms
12,896 KB |
testcase_21 | AC | 241 ms
8,348 KB |
testcase_22 | AC | 423 ms
17,320 KB |
testcase_23 | AC | 398 ms
17,780 KB |
testcase_24 | AC | 386 ms
12,996 KB |
testcase_25 | AC | 235 ms
7,516 KB |
testcase_26 | AC | 239 ms
7,516 KB |
testcase_27 | AC | 516 ms
21,824 KB |
testcase_28 | AC | 472 ms
21,824 KB |
testcase_29 | AC | 508 ms
21,684 KB |
testcase_30 | AC | 499 ms
21,684 KB |
testcase_31 | AC | 461 ms
21,752 KB |
testcase_32 | AC | 466 ms
21,752 KB |
testcase_33 | AC | 507 ms
21,752 KB |
testcase_34 | AC | 513 ms
21,912 KB |
testcase_35 | AC | 502 ms
21,912 KB |
testcase_36 | AC | 441 ms
21,912 KB |
testcase_37 | AC | 511 ms
21,912 KB |
testcase_38 | AC | 479 ms
21,912 KB |
testcase_39 | AC | 521 ms
21,912 KB |
testcase_40 | AC | 514 ms
21,912 KB |
testcase_41 | AC | 504 ms
21,912 KB |
testcase_42 | AC | 523 ms
21,912 KB |
testcase_43 | AC | 490 ms
21,912 KB |
testcase_44 | AC | 514 ms
21,912 KB |
testcase_45 | AC | 498 ms
21,912 KB |
testcase_46 | AC | 535 ms
21,912 KB |
testcase_47 | AC | 479 ms
21,460 KB |
testcase_48 | AC | 485 ms
21,460 KB |
testcase_49 | AC | 432 ms
21,460 KB |
testcase_50 | AC | 459 ms
21,460 KB |
testcase_51 | AC | 423 ms
21,460 KB |
testcase_52 | AC | 509 ms
21,912 KB |
testcase_53 | AC | 451 ms
21,912 KB |
testcase_54 | AC | 511 ms
21,912 KB |
testcase_55 | AC | 452 ms
21,912 KB |
testcase_56 | AC | 515 ms
21,912 KB |
testcase_57 | AC | 207 ms
21,908 KB |
testcase_58 | AC | 468 ms
21,824 KB |
testcase_59 | AC | 508 ms
21,824 KB |
testcase_60 | AC | 517 ms
21,824 KB |
testcase_61 | AC | 472 ms
21,824 KB |
testcase_62 | AC | 513 ms
21,824 KB |
testcase_63 | AC | 478 ms
21,972 KB |
testcase_64 | AC | 517 ms
21,824 KB |
testcase_65 | AC | 470 ms
22,084 KB |
testcase_66 | WA | - |
testcase_67 | AC | 464 ms
22,004 KB |
testcase_68 | AC | 495 ms
22,084 KB |
testcase_69 | AC | 460 ms
22,004 KB |
testcase_70 | WA | - |
testcase_71 | WA | - |
testcase_72 | AC | 507 ms
22,084 KB |
testcase_73 | AC | 462 ms
22,084 KB |
testcase_74 | AC | 517 ms
21,912 KB |
testcase_75 | AC | 494 ms
21,912 KB |
testcase_76 | AC | 493 ms
21,912 KB |
testcase_77 | AC | 484 ms
21,912 KB |
testcase_78 | AC | 498 ms
21,912 KB |
testcase_79 | AC | 454 ms
21,912 KB |
testcase_80 | AC | 508 ms
21,912 KB |
testcase_81 | AC | 481 ms
21,912 KB |
testcase_82 | AC | 507 ms
21,912 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; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } 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)); } enum MS = [1100000009, 1100000017, 1100000051, 1100000059, 1100000081, 1100000123, 1100000149, 1100000159, 1100000177, 1100000179]; enum H = cast(int)(MS.length); void main() { try { for (; ; ) { const N = readInt; const Q = readInt; const K = readLong; auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong; } auto L = new int[Q]; auto R = new int[Q]; foreach (q; 0 .. Q) { L[q] = readInt - 1; R[q] = readInt; } auto KK = new long[][](H, N + 1); auto fss = new long[][](H, N + 1); foreach (h; 0 .. H) { KK[h][0] = 1; foreach (i; 1 .. N + 1) { KK[h][i] = (KK[h][i - 1] * K) % MS[h]; } foreach_reverse (i; 0 .. N) { fss[h][i] = (A[i] + K * fss[h][i + 1]) % MS[h]; } } foreach (q; 0 .. Q) { bool ans; foreach (h; 0 .. H) { long val = (fss[h][L[q]] - KK[h][R[q] - L[q]] * fss[h][R[q]]) % MS[h]; ans = ans || val; } writeln(ans ? "Yes" : "No"); } } } catch (EOFException e) { } }