結果
問題 | No.2101 [Cherry Alpha N] ずっとこの数列だったらいいのに |
ユーザー | aaaaaaaaaa2230 |
提出日時 | 2022-10-14 23:58:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,174 ms / 6,000 ms |
コード長 | 3,667 bytes |
コンパイル時間 | 978 ms |
コンパイル使用メモリ | 86,780 KB |
実行使用メモリ | 216,256 KB |
最終ジャッジ日時 | 2023-09-09 00:59:19 |
合計ジャッジ時間 | 119,563 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
71,212 KB |
testcase_01 | AC | 70 ms
71,100 KB |
testcase_02 | AC | 71 ms
71,480 KB |
testcase_03 | AC | 1,964 ms
161,676 KB |
testcase_04 | AC | 2,875 ms
186,680 KB |
testcase_05 | AC | 1,755 ms
143,592 KB |
testcase_06 | AC | 2,495 ms
173,648 KB |
testcase_07 | AC | 2,911 ms
185,420 KB |
testcase_08 | AC | 2,605 ms
180,876 KB |
testcase_09 | AC | 1,502 ms
138,628 KB |
testcase_10 | AC | 1,355 ms
140,048 KB |
testcase_11 | AC | 1,949 ms
152,208 KB |
testcase_12 | AC | 1,987 ms
152,236 KB |
testcase_13 | AC | 1,486 ms
136,324 KB |
testcase_14 | AC | 1,231 ms
129,336 KB |
testcase_15 | AC | 3,216 ms
197,904 KB |
testcase_16 | AC | 2,707 ms
186,768 KB |
testcase_17 | AC | 974 ms
120,280 KB |
testcase_18 | AC | 3,777 ms
215,956 KB |
testcase_19 | AC | 4,015 ms
214,604 KB |
testcase_20 | AC | 3,876 ms
215,340 KB |
testcase_21 | AC | 4,024 ms
215,488 KB |
testcase_22 | AC | 4,174 ms
215,664 KB |
testcase_23 | AC | 4,061 ms
214,884 KB |
testcase_24 | AC | 3,956 ms
216,116 KB |
testcase_25 | AC | 3,994 ms
214,108 KB |
testcase_26 | AC | 3,752 ms
214,924 KB |
testcase_27 | AC | 3,834 ms
214,292 KB |
testcase_28 | AC | 3,851 ms
215,352 KB |
testcase_29 | AC | 3,913 ms
215,708 KB |
testcase_30 | AC | 3,806 ms
215,596 KB |
testcase_31 | AC | 3,810 ms
216,012 KB |
testcase_32 | AC | 3,788 ms
214,660 KB |
testcase_33 | AC | 3,748 ms
214,228 KB |
testcase_34 | AC | 3,609 ms
216,256 KB |
testcase_35 | AC | 3,523 ms
214,752 KB |
testcase_36 | AC | 3,528 ms
213,992 KB |
testcase_37 | AC | 3,546 ms
215,524 KB |
testcase_38 | AC | 475 ms
132,804 KB |
testcase_39 | AC | 1,278 ms
135,508 KB |
testcase_40 | AC | 1,317 ms
213,928 KB |
testcase_41 | AC | 70 ms
71,528 KB |
ソースコード
class SegTree: """ define what you want to do with 0 index, ex) size = tree_size, func = min or max, sta = default_value """ def __init__(self,size,func,sta): self.n = size self.size = 1 << size.bit_length() self.func = func self.sta = sta self.tree = [sta]*(2*self.size) def build(self, list): """ set list and update tree""" for i,x in enumerate(list,self.size): self.tree[i] = x for i in range(self.size-1,0,-1): self.tree[i] = self.func(self.tree[i<<1],self.tree[i<<1 | 1]) def set(self,i,x): i += self.size self.tree[i] = x while i > 1: i >>= 1 self.tree[i] = self.func(self.tree[i<<1],self.tree[i<<1 | 1]) def get(self,l,r): """ take the value of [l r) with func (min or max)""" l += self.size r += self.size res = self.sta while l < r: if l & 1: res = self.func(self.tree[l],res) l += 1 if r & 1: res = self.func(self.tree[r-1],res) l >>= 1 r >>= 1 return res def max_right(self, l, x): """[l,r) が ok であるような最大の r を返す""" if l == self.n: return l l += self.size res = self.sta check = True while check or (l & -l) != l: check = False while l%2 == 0: l >>= 1 if not self.func(res,self.tree[l]) < x: while l < self.size: l <<= 1 if self.func(res,self.tree[l]) < x: res = self.func(res,self.tree[l]) l += 1 return l - self.size res = self.func(res,self.tree[l]) l += 1 return self.n def min_left(self, r, x): """(r が ok であるような最小の r を返す probably wrong""" if r == 0: return 0 r += self.size res = self.sta check = True while check and (r & -r) != r: check = False r -= 1 while (r > 1 and r%2): r >>= 1 if not self.func(res, self.tree[r]) < x: while r < self.size: r = 2*r + 1 if self.func(res, self.tree[r]) < x: res = self.func(res, self.tree[r]) r -= 1 return r + 1 - self.size res = self.func(self.tree[r],res) return 0 def func(x,y): return x+y n = int(input()) AT = [list(map(int,input().split())) for i in range(n)] A = [a for a,t in AT] q = int(input()) DLR = [list(map(int,input().split())) for i in range(q)] ans = [0]*q event = [] for i,(a,t) in enumerate(AT): if a == 0: continue event.append([t,-1,i,0]) event.append([t+a,-2,i,0]) for i,(d,l,r) in enumerate(DLR): event.append([d,i,l,r]) seg1 = SegTree(n,func,0) seg2 = SegTree(n,func,0) seg3 = SegTree(n,func,0) seg4 = SegTree(n,func,0) seg1.build([a for a,t in AT]) event.sort() for day,ind,x,y in event: if ind == -1: seg1.set(x,0) seg2.set(x,A[x]) seg3.set(x,1) seg4.set(x,day) elif ind == -2: seg2.set(x,0) seg3.set(x,0) seg4.set(x,0) else: l,r = x-1,y # print(l,r,seg1.get(l,r),seg2.get(l,r),seg3.get(l,r),seg4.get(l,r)) count = seg1.get(l,r) + seg2.get(l,r)-seg3.get(l,r)*day + seg4.get(l,r)-seg3.get(l,r) ans[ind] = count for i in ans: print(i)