結果
問題 | No.2101 [Cherry Alpha N] ずっとこの数列だったらいいのに |
ユーザー | aaaaaaaaaa2230 |
提出日時 | 2022-10-15 00:00:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 3,562 ms / 6,000 ms |
コード長 | 3,493 bytes |
コンパイル時間 | 937 ms |
コンパイル使用メモリ | 86,404 KB |
実行使用メモリ | 211,400 KB |
最終ジャッジ日時 | 2023-09-09 01:03:10 |
合計ジャッジ時間 | 105,550 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,420 KB |
testcase_01 | AC | 69 ms
71,416 KB |
testcase_02 | AC | 69 ms
71,268 KB |
testcase_03 | AC | 1,757 ms
156,968 KB |
testcase_04 | AC | 2,552 ms
182,540 KB |
testcase_05 | AC | 1,613 ms
140,960 KB |
testcase_06 | AC | 2,264 ms
169,736 KB |
testcase_07 | AC | 2,737 ms
181,028 KB |
testcase_08 | AC | 2,427 ms
176,704 KB |
testcase_09 | AC | 1,409 ms
136,648 KB |
testcase_10 | AC | 1,266 ms
138,056 KB |
testcase_11 | AC | 1,790 ms
152,176 KB |
testcase_12 | AC | 1,812 ms
150,264 KB |
testcase_13 | AC | 1,326 ms
136,172 KB |
testcase_14 | AC | 1,104 ms
129,292 KB |
testcase_15 | AC | 2,886 ms
193,260 KB |
testcase_16 | AC | 2,439 ms
182,724 KB |
testcase_17 | AC | 913 ms
119,764 KB |
testcase_18 | AC | 3,460 ms
210,892 KB |
testcase_19 | AC | 3,437 ms
209,028 KB |
testcase_20 | AC | 3,432 ms
210,552 KB |
testcase_21 | AC | 3,353 ms
210,584 KB |
testcase_22 | AC | 3,312 ms
210,472 KB |
testcase_23 | AC | 3,333 ms
209,364 KB |
testcase_24 | AC | 3,292 ms
210,588 KB |
testcase_25 | AC | 3,361 ms
208,972 KB |
testcase_26 | AC | 3,339 ms
210,524 KB |
testcase_27 | AC | 3,333 ms
209,424 KB |
testcase_28 | AC | 3,562 ms
210,132 KB |
testcase_29 | AC | 3,371 ms
210,152 KB |
testcase_30 | AC | 3,346 ms
210,376 KB |
testcase_31 | AC | 3,379 ms
211,156 KB |
testcase_32 | AC | 3,279 ms
209,400 KB |
testcase_33 | AC | 3,132 ms
210,004 KB |
testcase_34 | AC | 3,177 ms
210,804 KB |
testcase_35 | AC | 3,150 ms
210,148 KB |
testcase_36 | AC | 3,144 ms
210,256 KB |
testcase_37 | AC | 3,133 ms
211,400 KB |
testcase_38 | AC | 392 ms
132,880 KB |
testcase_39 | AC | 1,149 ms
135,004 KB |
testcase_40 | AC | 1,147 ms
209,444 KB |
testcase_41 | AC | 85 ms
71,132 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) 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: seg3.set(x,1) seg4.set(x,day) elif ind == -2: seg1.set(x,0) seg3.set(x,0) seg4.set(x,0) else: l,r = x-1,y count = seg1.get(l,r) -seg3.get(l,r)*(day+1) + seg4.get(l,r) ans[ind] = count for i in ans: print(i)