結果
問題 | No.2421 entersys? |
ユーザー | rlangevin |
提出日時 | 2023-09-03 16:11:54 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,769 ms / 3,000 ms |
コード長 | 3,360 bytes |
コンパイル時間 | 512 ms |
コンパイル使用メモリ | 86,744 KB |
実行使用メモリ | 265,232 KB |
最終ジャッジ日時 | 2023-09-03 16:12:31 |
合計ジャッジ時間 | 33,514 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 116 ms
75,852 KB |
testcase_01 | AC | 129 ms
76,652 KB |
testcase_02 | AC | 181 ms
79,236 KB |
testcase_03 | AC | 129 ms
76,836 KB |
testcase_04 | AC | 137 ms
76,444 KB |
testcase_05 | AC | 156 ms
78,384 KB |
testcase_06 | AC | 176 ms
78,100 KB |
testcase_07 | AC | 150 ms
78,264 KB |
testcase_08 | AC | 155 ms
78,336 KB |
testcase_09 | AC | 172 ms
79,368 KB |
testcase_10 | AC | 149 ms
78,236 KB |
testcase_11 | AC | 1,493 ms
232,472 KB |
testcase_12 | AC | 1,715 ms
234,160 KB |
testcase_13 | AC | 1,506 ms
230,760 KB |
testcase_14 | AC | 1,458 ms
230,296 KB |
testcase_15 | AC | 1,456 ms
233,680 KB |
testcase_16 | AC | 1,504 ms
231,060 KB |
testcase_17 | AC | 1,525 ms
239,628 KB |
testcase_18 | AC | 1,531 ms
221,380 KB |
testcase_19 | AC | 1,482 ms
240,312 KB |
testcase_20 | AC | 1,471 ms
240,056 KB |
testcase_21 | AC | 1,373 ms
235,400 KB |
testcase_22 | AC | 1,116 ms
208,100 KB |
testcase_23 | AC | 1,710 ms
265,044 KB |
testcase_24 | AC | 1,769 ms
263,984 KB |
testcase_25 | AC | 1,663 ms
265,232 KB |
testcase_26 | AC | 1,160 ms
229,024 KB |
testcase_27 | AC | 1,148 ms
229,344 KB |
testcase_28 | AC | 1,124 ms
226,380 KB |
ソースコード
import sys input = sys.stdin.readline from collections import * class Fenwick_Tree: def __init__(self, n): self._n = n self.data = [0] * n def add(self, p, x): assert 0 <= p < self._n p += 1 while p <= self._n: self.data[p - 1] += x p += p & -p def sum(self, l, r): assert 0 <= l <= r <= self._n return self._sum(r) - self._sum(l) def _sum(self, r): s = 0 while r > 0: s += self.data[r - 1] r -= r & -r return s def get_size(self, x): x = self.find(x) while r > 0: s += self.data[r - 1] r -= r & -r return s def get(self, k): k += 1 x, r = 0, 1 while r < self._n: r <<= 1 len = r while len: if x + len - 1 < self._n: if self.data[x + len - 1] < k: k -= self.data[x + len - 1] x += len len >>= 1 return x from bisect import * from copy import deepcopy def compress(lst): """ B: lstを座圧したリスト D: indexから元の値を取得する辞書 """ B = [] D = dict() vals = deepcopy(lst) vals = list(set(vals)) vals.sort() for i in range(len(lst)): ind = bisect_left(vals, lst[i]) B.append(ind) for i in range(len(B)): D[lst[i]] = B[i] return B, D, vals N = int(input()) X, L, R = [0] * N, [0] * N, [0] * N D = defaultdict(list) query = [] for i in range(N): X[i], L[i], R[i] = input().split() L[i], R[i] = int(L[i]), int(R[i]) R[i] += 1 D[X[i]].append((0, L[i], R[i])) query.append((0, L[i], R[i])) lst = L + R Q = int(input()) for i in range(Q): qry = input().split() + [i] qry[0] = int(qry[0]) if qry[0] == 1: qry[2] = int(qry[2]) + 1 lst.append(qry[2]) D[qry[1]].append(qry) elif qry[0] == 2: qry[1] = int(qry[1]) + 1 lst.append(qry[1]) else: qry[2] = int(qry[2]) qry[3] = int(qry[3]) qry[3] += 1 lst.append(qry[2]) lst.append(qry[3]) D[qry[1]].append(qry) query.append(qry) ans = [-1] * Q B, ind, vals = compress(lst) M = max(B) + 1 T = Fenwick_Tree(M + 1) for k, L in D.items(): for q in L: if q[0] == 0: T.add(ind[q[1]], 1) T.add(ind[q[2]], -1) elif q[0] == 1: qq = q[-1] if T.sum(0, ind[q[2]]): ans[qq] = "Yes" else: ans[qq] = "No" elif q[0] == 3: T.add(ind[q[2]], 1) T.add(ind[q[3]], -1) for q in L: if q[0] == 0: T.add(ind[q[1]], -1) T.add(ind[q[2]], 1) elif q[0] == 1: continue elif q[0] == 3: T.add(ind[q[2]], -1) T.add(ind[q[3]], 1) T = Fenwick_Tree(M + 1) for q in query: if q[0] == 0: T.add(ind[q[1]], 1) T.add(ind[q[2]], -1) elif q[0] == 1: continue elif q[0] == 2: ans[q[-1]] = T.sum(0, ind[q[1]]) elif q[0] == 3: T.add(ind[q[2]], 1) T.add(ind[q[3]], -1) for a in ans: if a == -1: continue print(a)