結果
問題 | No.1675 Strange Minimum Query |
ユーザー | stng |
提出日時 | 2021-09-10 23:28:47 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,840 bytes |
コンパイル時間 | 304 ms |
コンパイル使用メモリ | 87,084 KB |
実行使用メモリ | 129,600 KB |
最終ジャッジ日時 | 2023-09-02 22:19:36 |
合計ジャッジ時間 | 50,269 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
71,364 KB |
testcase_01 | AC | 72 ms
71,464 KB |
testcase_02 | AC | 74 ms
71,272 KB |
testcase_03 | AC | 1,431 ms
99,360 KB |
testcase_04 | AC | 1,359 ms
105,976 KB |
testcase_05 | AC | 270 ms
84,560 KB |
testcase_06 | AC | 1,531 ms
102,180 KB |
testcase_07 | AC | 1,740 ms
116,680 KB |
testcase_08 | AC | 82 ms
76,292 KB |
testcase_09 | AC | 154 ms
78,360 KB |
testcase_10 | AC | 867 ms
102,400 KB |
testcase_11 | AC | 432 ms
93,480 KB |
testcase_12 | AC | 1,008 ms
103,864 KB |
testcase_13 | AC | 1,216 ms
120,564 KB |
testcase_14 | AC | 1,680 ms
126,756 KB |
testcase_15 | AC | 1,333 ms
128,220 KB |
testcase_16 | AC | 72 ms
71,424 KB |
testcase_17 | AC | 571 ms
87,608 KB |
testcase_18 | AC | 730 ms
88,568 KB |
testcase_19 | AC | 946 ms
99,232 KB |
testcase_20 | AC | 1,733 ms
108,416 KB |
testcase_21 | AC | 1,565 ms
106,684 KB |
testcase_22 | TLE | - |
testcase_23 | AC | 1,598 ms
99,916 KB |
testcase_24 | AC | 1,433 ms
100,740 KB |
testcase_25 | AC | 1,095 ms
93,948 KB |
testcase_26 | AC | 688 ms
90,616 KB |
testcase_27 | AC | 1,440 ms
105,384 KB |
testcase_28 | AC | 857 ms
98,324 KB |
testcase_29 | AC | 702 ms
96,152 KB |
testcase_30 | AC | 690 ms
90,752 KB |
testcase_31 | TLE | - |
testcase_32 | TLE | - |
testcase_33 | TLE | - |
testcase_34 | TLE | - |
testcase_35 | TLE | - |
testcase_36 | TLE | - |
ソースコード
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 def main(): #####segfunc##### def segfunc(x, y): return min(x, y) ################# #####ide_ele##### ide_ele = 10**9 ################# n,q = map(int,input().split()) lr = [[int(i)-1 for i in input().split()] for j in range(q)] lr.sort(key = lambda x:x[2]) a = [10**9]*n seg = LazySegTree_RUQ(a, segfunc=segfunc, ide_ele=ide_ele) for i in range(q): #lo = seg.query(lr[i][0],lr[i][1]+1) seg.update(lr[i][0],lr[i][1]+1,lr[i][2]+1) for i in range(q): b = seg.query(lr[i][0],lr[i][1]+1) if b != lr[i][2]+1: print(-1) exit() b = [10**9]*n for i in range(n): b[i] = seg.query(i,i+1) print(*b) if __name__ == '__main__': main()