結果

問題 No.2421 entersys?
ユーザー rlangevin
提出日時 2023-09-03 16:11:54
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,832 ms / 3,000 ms
コード長 3,360 bytes
コンパイル時間 210 ms
コンパイル使用メモリ 82,560 KB
実行使用メモリ 262,940 KB
最終ジャッジ日時 2024-06-12 21:52:05
合計ジャッジ時間 32,826 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0