結果
問題 | No.2650 [Cherry 6th Tune *] セイジャク |
ユーザー | Akijin_007 |
提出日時 | 2024-02-23 21:58:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,258 ms / 2,500 ms |
コード長 | 2,647 bytes |
コンパイル時間 | 458 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 174,984 KB |
最終ジャッジ日時 | 2024-03-24 09:16:59 |
合計ジャッジ時間 | 32,855 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
53,460 KB |
testcase_01 | AC | 35 ms
53,460 KB |
testcase_02 | AC | 446 ms
108,316 KB |
testcase_03 | AC | 322 ms
92,584 KB |
testcase_04 | AC | 1,021 ms
174,984 KB |
testcase_05 | AC | 765 ms
151,224 KB |
testcase_06 | AC | 479 ms
113,072 KB |
testcase_07 | AC | 817 ms
157,556 KB |
testcase_08 | AC | 374 ms
102,204 KB |
testcase_09 | AC | 1,234 ms
162,980 KB |
testcase_10 | AC | 1,222 ms
161,728 KB |
testcase_11 | AC | 1,236 ms
160,788 KB |
testcase_12 | AC | 1,258 ms
160,480 KB |
testcase_13 | AC | 1,230 ms
161,812 KB |
testcase_14 | AC | 1,223 ms
161,760 KB |
testcase_15 | AC | 1,214 ms
159,656 KB |
testcase_16 | AC | 967 ms
160,816 KB |
testcase_17 | AC | 955 ms
168,980 KB |
testcase_18 | AC | 959 ms
160,500 KB |
testcase_19 | AC | 980 ms
161,840 KB |
testcase_20 | AC | 963 ms
161,768 KB |
testcase_21 | AC | 988 ms
161,744 KB |
testcase_22 | AC | 952 ms
161,844 KB |
testcase_23 | AC | 914 ms
160,120 KB |
testcase_24 | AC | 926 ms
158,944 KB |
testcase_25 | AC | 842 ms
160,428 KB |
testcase_26 | AC | 872 ms
159,280 KB |
testcase_27 | AC | 930 ms
159,180 KB |
testcase_28 | AC | 847 ms
160,448 KB |
testcase_29 | AC | 886 ms
160,436 KB |
testcase_30 | AC | 873 ms
160,792 KB |
testcase_31 | AC | 1,077 ms
162,080 KB |
testcase_32 | AC | 462 ms
116,992 KB |
ソースコード
#int(input()) #map(int, input().split()) #list(map(int, input().split())) #区間更新用 def segfunc(x,y): return max(x,y) class LazySegTree_RUQ: def __init__(self,init_val,segfunc,ide_ele): n = len(init_val) self.segfunc = segfunc self.ide_ele = ide_ele self.num = 1<<(n-1).bit_length() self.tree = [ide_ele]*2*self.num self.lazy = [None]*2*self.num for i in range(n): self.tree[self.num+i] = init_val[i] for i in range(self.num-1,0,-1): self.tree[i] = self.segfunc(self.tree[2*i],self.tree[2*i+1]) def gindex(self,l,r): l += self.num r += self.num lm = l>>(l&-l).bit_length() rm = r>>(r&-r).bit_length() while r>l: if l<=lm: yield l if r<=rm: yield r r >>= 1 l >>= 1 while l: yield l l >>= 1 def propagates(self,*ids): for i in reversed(ids): v = self.lazy[i] if v is None: continue self.lazy[i] = None self.lazy[2*i] = v self.lazy[2*i+1] = v self.tree[2*i] = v self.tree[2*i+1] = v def update(self,l,r,x): ids = self.gindex(l,r) self.propagates(*self.gindex(l,r)) l += self.num r += self.num while l<r: if l&1: self.lazy[l] = x self.tree[l] = x l += 1 if r&1: self.lazy[r-1] = x self.tree[r-1] = x r >>= 1 l >>= 1 for i in ids: self.tree[i] = self.segfunc(self.tree[2*i], self.tree[2*i+1]) def query(self,l,r): ids = self.gindex(l,r) self.propagates(*self.gindex(l,r)) res = self.ide_ele l += self.num r += self.num while l<r: if l&1: res = self.segfunc(res,self.tree[l]) l += 1 if r&1: res = self.segfunc(res,self.tree[r-1]) l >>= 1 r >>= 1 return res N, A = map(int, input().split()) X = list(map(int, input().split())) T = int(input()) l = [0] * T for i in range(T): l[i] = list(map(int, input().split())) x = set(X) for i in range(T): x.add(l[i][0]) x.add(l[i][1]) x = sorted(x) ll = len(x) d = dict() for i in range(ll): d[x[i]] = i s = LazySegTree_RUQ([-1] * ll, segfunc, -1) for i in range(T): L, R = l[i] s.update(d[L], d[R]+1, i+1) for i in range(N): print(s.query(d[X[i]], d[X[i]]+1))