結果
問題 | No.1982 [Cherry 4th Tune B] 絶険 |
ユーザー | tamato |
提出日時 | 2022-06-17 23:19:54 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,847 bytes |
コンパイル時間 | 277 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 273,732 KB |
最終ジャッジ日時 | 2024-04-17 15:48:18 |
合計ジャッジ時間 | 46,618 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
52,480 KB |
testcase_01 | AC | 39 ms
51,968 KB |
testcase_02 | AC | 45 ms
57,088 KB |
testcase_03 | AC | 821 ms
178,956 KB |
testcase_04 | AC | 1,250 ms
212,168 KB |
testcase_05 | AC | 1,016 ms
180,352 KB |
testcase_06 | AC | 1,502 ms
231,980 KB |
testcase_07 | AC | 1,851 ms
257,732 KB |
testcase_08 | AC | 1,255 ms
217,764 KB |
testcase_09 | AC | 1,481 ms
233,312 KB |
testcase_10 | AC | 1,561 ms
232,232 KB |
testcase_11 | AC | 803 ms
166,144 KB |
testcase_12 | AC | 1,692 ms
245,284 KB |
testcase_13 | AC | 820 ms
183,204 KB |
testcase_14 | AC | 1,081 ms
210,128 KB |
testcase_15 | AC | 891 ms
182,480 KB |
testcase_16 | AC | 1,328 ms
209,088 KB |
testcase_17 | AC | 2,556 ms
273,592 KB |
testcase_18 | AC | 2,161 ms
265,788 KB |
testcase_19 | AC | 2,458 ms
268,992 KB |
testcase_20 | AC | 374 ms
119,836 KB |
testcase_21 | AC | 616 ms
147,584 KB |
testcase_22 | AC | 1,047 ms
204,536 KB |
testcase_23 | AC | 585 ms
135,664 KB |
testcase_24 | AC | 841 ms
170,368 KB |
testcase_25 | AC | 2,402 ms
267,332 KB |
testcase_26 | AC | 2,310 ms
264,668 KB |
testcase_27 | AC | 423 ms
118,912 KB |
testcase_28 | AC | 183 ms
103,040 KB |
testcase_29 | AC | 2,959 ms
265,904 KB |
testcase_30 | AC | 1,560 ms
272,044 KB |
testcase_31 | AC | 268 ms
131,100 KB |
testcase_32 | TLE | - |
testcase_33 | AC | 2,360 ms
273,732 KB |
testcase_34 | AC | 2,352 ms
272,384 KB |
ソースコード
mod = 998244353 def main(): import sys input = sys.stdin.buffer.readline class Bit: def __init__(self, n): self.size = n self.tree = [0] * (n + 1) def sum(self, i): s = 0 while i > 0: s += self.tree[i] i -= i & -i return s def add(self, i, x): while i <= self.size: self.tree[i] += x i += i & -i def lower_bound(self, w): if w <= 0: return 0 x = 0 k = 1 << (self.size.bit_length() - 1) while k: if x + k <= self.size and self.tree[x + k] < w: w -= self.tree[x + k] x += k k >>= 1 return x + 1 N, K, Q = map(int, input().split()) ope = [] for _ in range(K): ope.append(tuple(map(int, input().split()))) query = [] for _ in range(Q): query.append(tuple(map(int, input().split()))) OK = [K] * Q NG = [-1] * Q for _ in range(K.bit_length()): MID = [(ok + ng) // 2 for ok, ng in zip(OK, NG)] T = [[] for _ in range(K+1)] for i, t in enumerate(MID): T[t].append(i) bit = Bit(N+1) for k in range(K): l, r, c, h = ope[k] bit.add(l, h) if r != N: bit.add(r + 1, -h) for i in T[k]: j, x = query[i] hh = bit.sum(j) if x <= hh: OK[i] = MID[i] else: NG[i] = MID[i] for i in range(Q): k = OK[i] if k < K: _, _, c, _ = ope[k] print(c) else: print(-1) if __name__ == '__main__': main()