結果
問題 | No.1676 Coin Trade (Single) |
ユーザー | brthyyjp |
提出日時 | 2021-09-10 22:23:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 323 ms / 2,000 ms |
コード長 | 1,991 bytes |
コンパイル時間 | 423 ms |
コンパイル使用メモリ | 86,740 KB |
実行使用メモリ | 90,888 KB |
最終ジャッジ日時 | 2023-09-02 18:32:25 |
合計ジャッジ時間 | 7,982 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 79 ms
71,388 KB |
testcase_01 | AC | 81 ms
71,196 KB |
testcase_02 | AC | 79 ms
71,212 KB |
testcase_03 | AC | 274 ms
87,416 KB |
testcase_04 | AC | 269 ms
86,416 KB |
testcase_05 | AC | 230 ms
85,224 KB |
testcase_06 | AC | 240 ms
85,764 KB |
testcase_07 | AC | 237 ms
84,464 KB |
testcase_08 | AC | 195 ms
81,196 KB |
testcase_09 | AC | 240 ms
84,136 KB |
testcase_10 | AC | 219 ms
83,968 KB |
testcase_11 | AC | 276 ms
88,220 KB |
testcase_12 | AC | 210 ms
81,776 KB |
testcase_13 | AC | 80 ms
71,400 KB |
testcase_14 | AC | 79 ms
71,296 KB |
testcase_15 | AC | 79 ms
71,384 KB |
testcase_16 | AC | 81 ms
71,292 KB |
testcase_17 | AC | 80 ms
71,324 KB |
testcase_18 | AC | 81 ms
71,216 KB |
testcase_19 | AC | 79 ms
71,504 KB |
testcase_20 | AC | 79 ms
71,376 KB |
testcase_21 | AC | 80 ms
71,148 KB |
testcase_22 | AC | 81 ms
71,220 KB |
testcase_23 | AC | 80 ms
71,292 KB |
testcase_24 | AC | 83 ms
71,288 KB |
testcase_25 | AC | 78 ms
71,428 KB |
testcase_26 | AC | 78 ms
70,984 KB |
testcase_27 | AC | 78 ms
71,388 KB |
testcase_28 | AC | 79 ms
71,204 KB |
testcase_29 | AC | 79 ms
71,292 KB |
testcase_30 | AC | 78 ms
71,288 KB |
testcase_31 | AC | 79 ms
71,448 KB |
testcase_32 | AC | 79 ms
71,316 KB |
testcase_33 | AC | 323 ms
90,888 KB |
testcase_34 | AC | 303 ms
90,288 KB |
testcase_35 | AC | 315 ms
90,660 KB |
testcase_36 | AC | 316 ms
90,644 KB |
testcase_37 | AC | 307 ms
90,732 KB |
ソースコード
class SegTree: def __init__(self, init_val, ide_ele, segfunc): self.n = len(init_val) self.num = 2**(self.n-1).bit_length() self.ide_ele = ide_ele self.segfunc = segfunc self.seg = [ide_ele]*2*self.num # set_val for i in range(self.n): self.seg[i+self.num] = init_val[i] # built for i in range(self.num-1, 0, -1): self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1]) def update(self, k, x): k += self.num self.seg[k] = x while k: k = k >> 1 self.seg[k] = self.segfunc(self.seg[2*k], self.seg[2*k+1]) def query(self, l, r): if r <= l: return self.ide_ele l += self.num r += self.num lres = self.ide_ele rres = self.ide_ele while l < r: if r & 1: r -= 1 rres = self.segfunc(self.seg[r], rres) if l & 1: lres = self.segfunc(lres, self.seg[l]) l += 1 l = l >> 1 r = r >> 1 res = self.segfunc(lres, rres) return res def __str__(self): # for debug arr = [self.query(i,i+1) for i in range(self.n)] return str(arr) def segfunc(x, y): if x >= y: return x else: return y import sys import io, os input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline def main(): n, k = map(int, input().split()) A = [0]*n B = [0]*n for i in range(n): a, m = map(int, input().split()) A[i] = a b = list(map(int, input().split())) b = [j-1 for j in b] B[i] = b ans = 0 seg = SegTree([0]*n, 0, max) for i in range(n): temp = 0 for b in B[i]: x = A[i]-A[b]+seg.query(0, b+1) temp = max(temp, x) seg.update(i, temp) ans = max(ans, temp) print(ans) if __name__ == '__main__': main()