結果
問題 | No.2220 Range Insert & Point Mex |
ユーザー | flygon |
提出日時 | 2023-02-17 23:03:09 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,908 bytes |
コンパイル時間 | 1,229 ms |
コンパイル使用メモリ | 86,800 KB |
実行使用メモリ | 123,724 KB |
最終ジャッジ日時 | 2023-09-26 20:25:00 |
合計ジャッジ時間 | 17,400 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 102 ms
84,740 KB |
testcase_01 | AC | 104 ms
84,784 KB |
testcase_02 | AC | 103 ms
84,816 KB |
testcase_03 | WA | - |
testcase_04 | AC | 102 ms
84,844 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 104 ms
84,880 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 467 ms
108,020 KB |
testcase_21 | AC | 463 ms
108,172 KB |
testcase_22 | AC | 460 ms
108,100 KB |
testcase_23 | AC | 427 ms
111,972 KB |
testcase_24 | AC | 387 ms
104,848 KB |
testcase_25 | AC | 345 ms
100,400 KB |
testcase_26 | AC | 300 ms
113,856 KB |
testcase_27 | AC | 257 ms
100,604 KB |
testcase_28 | AC | 139 ms
102,536 KB |
testcase_29 | AC | 200 ms
101,152 KB |
testcase_30 | AC | 145 ms
102,856 KB |
testcase_31 | AC | 288 ms
119,880 KB |
testcase_32 | AC | 322 ms
111,560 KB |
testcase_33 | AC | 348 ms
111,784 KB |
testcase_34 | AC | 629 ms
123,724 KB |
testcase_35 | AC | 648 ms
122,796 KB |
testcase_36 | AC | 614 ms
123,484 KB |
testcase_37 | AC | 631 ms
122,828 KB |
testcase_38 | AC | 369 ms
118,128 KB |
ソースコード
import sys sys.setrecursionlimit(5*10**5) input = sys.stdin.readline from collections import defaultdict, deque, Counter from heapq import heappop, heappush from bisect import bisect_left, bisect_right from math import gcd n= int(input()) lr = [list(map(int,input().split())) for i in range(n)] q = int(input()) x = list(map(int,input().split())) lr.sort(key = lambda x: (x[2], x[0])) lr = lr[::-1] INF= 10**10 seg_len = 1<<19 # > 5*(10**5) seg = [INF]*(2*seg_len) for i in range(q): seg[i+seg_len] = i for i in range(seg_len)[::-1]: seg[i] = min(seg[i*2], seg[i*2+1]) def update(pos): pos += seg_len seg[pos] = INF while True: pos >>= 1 if not pos: break seg[pos] = min(seg[pos<<1], seg[pos<<1|1]) def get_query(l,r): l += seg_len; r += seg_len res = INF while l < r: if l & 1: res = min(res, seg[l]) l += 1 if r & 1: r -= 1 res = min(res, seg[r]) l >>= 1; r >>= 1 return res ans = [-1]*q for num in range(n+10): use = [] while lr and lr[-1][2] == num: l,r,_ = lr.pop() tl = bisect_left(x,l) tr = bisect_right(x,r) use.append([tl,tr]) if not use: break ss = set() for i in range(len(use)): tl,tr = use[i] if i == 0: tmp = get_query(0, tl) while tmp != INF: update(tmp) ss.add(tmp) ans[tmp] = num tmp = get_query(0,tl) if i == len(use) - 1: tmp = get_query(tr, seg_len) while tmp != INF: update(tmp) ss.add(tmp) ans[tmp] = num tmp = get_query(tr, seg_len) if i != 0: prer = use[i-1][1] if prer > tl: continue tmp = get_query(prer, tl) while tmp != INF: update(tmp) ss.add(tmp) ans[tmp] = num tmp = get_query(prer,tl) # print(num, use) # print(ss) for i in range(q): if ans[i] == -1: ans[i] = num print(*ans, sep = "\n")