結果
問題 | No.2220 Range Insert & Point Mex |
ユーザー | mkawa2 |
提出日時 | 2023-02-18 00:31:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 581 ms / 2,000 ms |
コード長 | 3,263 bytes |
コンパイル時間 | 1,944 ms |
コンパイル使用メモリ | 86,672 KB |
実行使用メモリ | 230,252 KB |
最終ジャッジ日時 | 2023-09-28 18:17:52 |
合計ジャッジ時間 | 16,728 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 98 ms
71,760 KB |
testcase_01 | AC | 99 ms
71,684 KB |
testcase_02 | AC | 100 ms
71,676 KB |
testcase_03 | AC | 102 ms
72,160 KB |
testcase_04 | AC | 99 ms
71,496 KB |
testcase_05 | AC | 102 ms
72,376 KB |
testcase_06 | AC | 103 ms
71,964 KB |
testcase_07 | AC | 102 ms
72,436 KB |
testcase_08 | AC | 103 ms
72,372 KB |
testcase_09 | AC | 103 ms
72,320 KB |
testcase_10 | AC | 103 ms
72,480 KB |
testcase_11 | AC | 100 ms
71,500 KB |
testcase_12 | AC | 102 ms
72,332 KB |
testcase_13 | AC | 581 ms
212,468 KB |
testcase_14 | AC | 567 ms
212,356 KB |
testcase_15 | AC | 567 ms
212,504 KB |
testcase_16 | AC | 569 ms
212,356 KB |
testcase_17 | AC | 568 ms
212,396 KB |
testcase_18 | AC | 577 ms
212,596 KB |
testcase_19 | AC | 574 ms
212,424 KB |
testcase_20 | AC | 547 ms
230,252 KB |
testcase_21 | AC | 556 ms
230,108 KB |
testcase_22 | AC | 559 ms
229,868 KB |
testcase_23 | AC | 563 ms
150,232 KB |
testcase_24 | AC | 526 ms
132,500 KB |
testcase_25 | AC | 433 ms
138,760 KB |
testcase_26 | AC | 546 ms
147,652 KB |
testcase_27 | AC | 344 ms
113,600 KB |
testcase_28 | AC | 240 ms
140,192 KB |
testcase_29 | AC | 248 ms
141,020 KB |
testcase_30 | AC | 239 ms
141,332 KB |
testcase_31 | AC | 340 ms
145,344 KB |
testcase_32 | AC | 304 ms
123,328 KB |
testcase_33 | AC | 354 ms
119,216 KB |
testcase_34 | AC | 444 ms
135,624 KB |
testcase_35 | AC | 533 ms
159,612 KB |
testcase_36 | AC | 405 ms
130,132 KB |
testcase_37 | AC | 473 ms
126,972 KB |
testcase_38 | AC | 558 ms
147,692 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 # md = 10**9+7 md = 998244353 from collections import defaultdict class DualSegTree: def __init__(self, op, e, v): self._op = op self._e = e() if isinstance(v, int): v = [self._e]*v self._n = len(v) self._log = (self._n-1).bit_length() self._size = 1 << self._log self._d = [self._e]*(2*self._size) for i in range(self._n): self._d[self._size+i] = v[i] def apply(self, left, right, f): assert 0 <= left <= right <= self._n if left == right: return left += self._size right += self._size for i in range(self._log, 0, -1): if ((left >> i) << i) != left: self._push(left >> i) if ((right >> i) << i) != right: self._push((right-1) >> i) while left < right: if left & 1: self._d[left] = self._op(self._d[left], f) left += 1 if right & 1: right -= 1 self._d[right] = self._op(self._d[right], f) left >>= 1 right >>= 1 def get(self, p): assert 0 <= p < self._n p += self._size res = self._e while p: res = self._op(res, self._d[p]) p >>= 1 return res def all_array(self): res = [] for i in range(self._n): res.append(self.get(i)) return res def _push(self, k): self._d[k*2] = self._op(self._d[k*2], self._d[k]) self._d[k*2+1] = self._op(self._d[k*2+1], self._d[k]) self._d[k] = self._e def e():return inf n=II() alr=defaultdict(list) dec=set([0]) mx=0 for _ in range(n): l,r,a=LI() r+=1 alr[a].append((l,r)) dec.add(l) dec.add(r) mx=max(mx,r) q=II() xx=LI() mx=max(mx,xx[-1]) dec.add(mx+1) dec|=set(xx) dec=sorted(dec) enc={a:i for i,a in enumerate(dec)} aa=sorted(alr) for i,a in enumerate(aa): if i!=a:break alr[a].sort(key=lambda x:x[0]) L=R=-1 cur=[(0,0)] for l,r in alr[a]: if L==-1: L,R=l,r elif R<l: cur.append((L,R)) L,R=l,r elif r>R: R=r cur.append((L,R)) cur.append((mx+1,mx+1)) alr[a]=cur m=len(dec) st=DualSegTree(min,e,m) last=-1 for i,a in enumerate(aa): if i!=a:break last=a pr=-1 for l,r in alr[a]: l,r=enc[l],enc[r] if pr>-1:st.apply(pr,l,a) pr=r for x in xx: x=enc[x] ans=st.get(x) if ans==inf:ans=last+1 print(ans)