結果
問題 | No.1982 [Cherry 4th Tune B] 絶険 |
ユーザー | tamato |
提出日時 | 2022-06-17 23:15:40 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,882 bytes |
コンパイル時間 | 232 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 280,612 KB |
最終ジャッジ日時 | 2024-04-17 15:42:16 |
合計ジャッジ時間 | 45,193 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 39 ms
52,352 KB |
testcase_01 | AC | 41 ms
52,224 KB |
testcase_02 | AC | 46 ms
58,752 KB |
testcase_03 | AC | 912 ms
185,304 KB |
testcase_04 | AC | 1,276 ms
219,128 KB |
testcase_05 | AC | 1,026 ms
185,784 KB |
testcase_06 | AC | 1,651 ms
239,900 KB |
testcase_07 | AC | 1,977 ms
266,400 KB |
testcase_08 | AC | 1,283 ms
221,620 KB |
testcase_09 | AC | 1,584 ms
243,876 KB |
testcase_10 | AC | 1,671 ms
237,116 KB |
testcase_11 | AC | 852 ms
170,872 KB |
testcase_12 | AC | 1,832 ms
254,564 KB |
testcase_13 | AC | 937 ms
188,708 KB |
testcase_14 | AC | 1,144 ms
217,468 KB |
testcase_15 | AC | 973 ms
187,368 KB |
testcase_16 | AC | 1,478 ms
216,480 KB |
testcase_17 | AC | 2,729 ms
267,788 KB |
testcase_18 | AC | 2,353 ms
266,700 KB |
testcase_19 | AC | 2,676 ms
269,616 KB |
testcase_20 | AC | 380 ms
122,092 KB |
testcase_21 | AC | 649 ms
151,168 KB |
testcase_22 | AC | 1,144 ms
211,096 KB |
testcase_23 | AC | 617 ms
138,832 KB |
testcase_24 | AC | 915 ms
175,744 KB |
testcase_25 | AC | 2,563 ms
271,672 KB |
testcase_26 | AC | 2,563 ms
269,032 KB |
testcase_27 | AC | 432 ms
120,192 KB |
testcase_28 | AC | 228 ms
131,232 KB |
testcase_29 | TLE | - |
testcase_30 | AC | 1,890 ms
267,720 KB |
testcase_31 | AC | 327 ms
135,420 KB |
testcase_32 | TLE | - |
testcase_33 | AC | 2,493 ms
280,068 KB |
testcase_34 | AC | 2,537 ms
280,612 KB |
ソースコード
mod = 998244353 def main(): import sys input = sys.stdin.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() + 1): MID = [(ok + ng) // 2 for ok, ng in zip(OK, NG)] #print(OK, NG, MID) T = [[] for _ in range(K+1)] for i, t in enumerate(MID): T[t].append(i) bit = Bit(N+2) for k in range(K): l, r, c, h = ope[k] t = k bit.add(l, h) bit.add(r + 1, -h) for i in T[t]: 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) #print(OK, NG) if __name__ == '__main__': main()