結果
問題 | No.2592 おでぶなおばけさん 2 |
ユーザー | rlangevin |
提出日時 | 2023-12-20 22:34:49 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,051 bytes |
コンパイル時間 | 621 ms |
コンパイル使用メモリ | 81,792 KB |
実行使用メモリ | 94,868 KB |
最終ジャッジ日時 | 2023-12-20 22:35:41 |
合計ジャッジ時間 | 47,683 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
52,096 KB |
testcase_01 | AC | 179 ms
82,560 KB |
testcase_02 | AC | 293 ms
80,852 KB |
testcase_03 | AC | 192 ms
78,464 KB |
testcase_04 | AC | 220 ms
77,696 KB |
testcase_05 | AC | 285 ms
91,008 KB |
testcase_06 | AC | 272 ms
81,188 KB |
testcase_07 | AC | 383 ms
81,024 KB |
testcase_08 | AC | 268 ms
84,992 KB |
testcase_09 | AC | 179 ms
79,216 KB |
testcase_10 | AC | 260 ms
77,568 KB |
testcase_11 | AC | 279 ms
85,120 KB |
testcase_12 | AC | 164 ms
78,256 KB |
testcase_13 | AC | 503 ms
85,632 KB |
testcase_14 | AC | 537 ms
85,760 KB |
testcase_15 | AC | 476 ms
82,944 KB |
testcase_16 | AC | 501 ms
85,760 KB |
testcase_17 | AC | 553 ms
88,832 KB |
testcase_18 | AC | 482 ms
83,072 KB |
testcase_19 | AC | 506 ms
80,196 KB |
testcase_20 | AC | 471 ms
81,792 KB |
testcase_21 | AC | 447 ms
79,460 KB |
testcase_22 | AC | 529 ms
85,888 KB |
testcase_23 | AC | 539 ms
90,352 KB |
testcase_24 | AC | 525 ms
83,968 KB |
testcase_25 | AC | 457 ms
79,140 KB |
testcase_26 | AC | 442 ms
79,104 KB |
testcase_27 | AC | 594 ms
92,160 KB |
testcase_28 | AC | 569 ms
92,160 KB |
testcase_29 | AC | 593 ms
92,160 KB |
testcase_30 | AC | 567 ms
92,160 KB |
testcase_31 | AC | 600 ms
92,032 KB |
testcase_32 | AC | 599 ms
92,032 KB |
testcase_33 | AC | 595 ms
92,032 KB |
testcase_34 | AC | 560 ms
94,848 KB |
testcase_35 | AC | 559 ms
94,848 KB |
testcase_36 | AC | 568 ms
94,848 KB |
testcase_37 | AC | 558 ms
94,848 KB |
testcase_38 | AC | 583 ms
94,848 KB |
testcase_39 | AC | 558 ms
94,868 KB |
testcase_40 | AC | 604 ms
94,868 KB |
testcase_41 | AC | 550 ms
94,868 KB |
testcase_42 | AC | 585 ms
94,868 KB |
testcase_43 | AC | 563 ms
94,868 KB |
testcase_44 | AC | 573 ms
94,868 KB |
testcase_45 | AC | 553 ms
94,868 KB |
testcase_46 | AC | 576 ms
94,868 KB |
testcase_47 | AC | 538 ms
91,060 KB |
testcase_48 | AC | 529 ms
91,060 KB |
testcase_49 | AC | 555 ms
91,060 KB |
testcase_50 | AC | 532 ms
91,060 KB |
testcase_51 | AC | 556 ms
91,060 KB |
testcase_52 | AC | 508 ms
94,868 KB |
testcase_53 | AC | 532 ms
94,868 KB |
testcase_54 | AC | 500 ms
94,868 KB |
testcase_55 | AC | 511 ms
94,868 KB |
testcase_56 | AC | 528 ms
94,868 KB |
testcase_57 | AC | 129 ms
91,060 KB |
testcase_58 | AC | 552 ms
92,220 KB |
testcase_59 | AC | 579 ms
92,220 KB |
testcase_60 | AC | 570 ms
92,220 KB |
testcase_61 | AC | 574 ms
92,220 KB |
testcase_62 | AC | 556 ms
92,236 KB |
testcase_63 | AC | 553 ms
93,488 KB |
testcase_64 | AC | 566 ms
92,220 KB |
testcase_65 | AC | 582 ms
92,784 KB |
testcase_66 | AC | 561 ms
92,784 KB |
testcase_67 | AC | 563 ms
92,672 KB |
testcase_68 | AC | 547 ms
92,784 KB |
testcase_69 | AC | 540 ms
92,672 KB |
testcase_70 | AC | 558 ms
92,784 KB |
testcase_71 | AC | 555 ms
92,796 KB |
testcase_72 | AC | 576 ms
92,784 KB |
testcase_73 | AC | 570 ms
92,784 KB |
testcase_74 | WA | - |
testcase_75 | AC | 578 ms
94,868 KB |
testcase_76 | AC | 558 ms
94,868 KB |
testcase_77 | AC | 548 ms
94,868 KB |
testcase_78 | AC | 582 ms
94,868 KB |
testcase_79 | AC | 560 ms
94,868 KB |
testcase_80 | AC | 596 ms
94,868 KB |
testcase_81 | AC | 577 ms
94,856 KB |
testcase_82 | AC | 608 ms
94,868 KB |
testcase_83 | AC | 560 ms
94,868 KB |
ソースコード
class SegmentTree: def __init__(self, n, identity_e, combine_f, ): self._n = n self._size = 1 while self._size < self._n: self._size <<= 1 self._identity_e = identity_e self._combine_f = combine_f self._node = [self._identity_e] * (2 * self._size) def build(self, array): assert len(array) == self._n for index, value in enumerate(array, start=self._size): self._node[index] = value for index in range(self._size - 1, 0, -1): self._node[index] = self._combine_f( self._node[index << 1 | 0], self._node[index << 1 | 1] ) def update(self, index, value): i = self._size + index self._node[i] = value while i > 1: i >>= 1 self._node[i] = self._combine_f( self._node[i << 1 | 0], self._node[i << 1 | 1] ) def fold(self, L, R): L += self._size R += self._size value_L = self._identity_e value_R = self._identity_e while L < R: if L & 1: value_L = self._combine_f(value_L, self._node[L]) L += 1 if R & 1: R -= 1 value_R = self._combine_f(self._node[R], value_R) L >>= 1 R >>= 1 return self._combine_f(value_L, value_R) N, Q, K = map(int, input().split()) A = list(map(int, input().split())) mod = 10 ** 9 + 9 p = [1] * (N + 1) for i in range(N): p[i + 1] = p[i] * K % mod def op(x, y): a = (x[0] + y[0] * p[x[1]]) % mod b = x[1] + y[1] return (a, b) T = SegmentTree(N, (0, 0), op) for i in range(N): T.update(i, (A[i]%mod, 1)) for i in range(Q): l, r = map(int, input().split()) l -= 1 if T.fold(l, r)[0]: print("Yes") else: print("No")