結果
問題 | No.1014 competitive fighting |
ユーザー | tpyneriver |
提出日時 | 2020-03-08 02:44:50 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,290 ms / 2,000 ms |
コード長 | 3,427 bytes |
コンパイル時間 | 1,733 ms |
コンパイル使用メモリ | 86,760 KB |
実行使用メモリ | 153,848 KB |
最終ジャッジ日時 | 2023-09-21 19:15:26 |
合計ジャッジ時間 | 35,322 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 83 ms
71,568 KB |
testcase_01 | AC | 78 ms
71,424 KB |
testcase_02 | AC | 81 ms
71,152 KB |
testcase_03 | AC | 78 ms
71,352 KB |
testcase_04 | AC | 78 ms
71,448 KB |
testcase_05 | AC | 1,169 ms
136,124 KB |
testcase_06 | AC | 1,174 ms
139,780 KB |
testcase_07 | AC | 1,022 ms
139,516 KB |
testcase_08 | AC | 1,290 ms
139,732 KB |
testcase_09 | AC | 1,249 ms
139,696 KB |
testcase_10 | AC | 513 ms
153,848 KB |
testcase_11 | AC | 331 ms
151,108 KB |
testcase_12 | AC | 1,248 ms
139,596 KB |
testcase_13 | AC | 749 ms
110,452 KB |
testcase_14 | AC | 652 ms
104,116 KB |
testcase_15 | AC | 772 ms
117,688 KB |
testcase_16 | AC | 169 ms
79,896 KB |
testcase_17 | AC | 428 ms
92,776 KB |
testcase_18 | AC | 915 ms
132,176 KB |
testcase_19 | AC | 1,283 ms
152,072 KB |
testcase_20 | AC | 593 ms
105,240 KB |
testcase_21 | AC | 821 ms
137,840 KB |
testcase_22 | AC | 854 ms
116,448 KB |
testcase_23 | AC | 452 ms
93,676 KB |
testcase_24 | AC | 441 ms
94,500 KB |
testcase_25 | AC | 229 ms
82,536 KB |
testcase_26 | AC | 859 ms
137,760 KB |
testcase_27 | AC | 373 ms
89,268 KB |
testcase_28 | AC | 448 ms
91,228 KB |
testcase_29 | AC | 133 ms
77,836 KB |
testcase_30 | AC | 1,016 ms
153,024 KB |
testcase_31 | AC | 911 ms
137,712 KB |
testcase_32 | AC | 121 ms
77,664 KB |
testcase_33 | AC | 164 ms
81,276 KB |
testcase_34 | AC | 498 ms
137,844 KB |
testcase_35 | AC | 632 ms
152,760 KB |
testcase_36 | AC | 497 ms
116,544 KB |
testcase_37 | AC | 135 ms
79,160 KB |
testcase_38 | AC | 445 ms
116,492 KB |
testcase_39 | AC | 306 ms
99,464 KB |
testcase_40 | AC | 423 ms
120,964 KB |
testcase_41 | AC | 308 ms
101,972 KB |
testcase_42 | AC | 557 ms
152,160 KB |
testcase_43 | AC | 165 ms
81,044 KB |
testcase_44 | AC | 554 ms
131,576 KB |
testcase_45 | AC | 386 ms
116,232 KB |
testcase_46 | AC | 163 ms
82,336 KB |
testcase_47 | AC | 270 ms
98,460 KB |
testcase_48 | AC | 486 ms
125,812 KB |
testcase_49 | AC | 146 ms
79,532 KB |
testcase_50 | AC | 576 ms
129,208 KB |
testcase_51 | AC | 346 ms
117,584 KB |
testcase_52 | AC | 135 ms
79,488 KB |
testcase_53 | AC | 1,221 ms
139,540 KB |
ソースコード
import sys readline = sys.stdin.buffer.readline from operator import itemgetter def compress(L): N = len(L) L2 = sorted([N*L[i]+i for i in range(N)]) C = {v : k for k, v in enumerate(L2)} return [C[N*L[i]+i] for i in range(N)] class Segtree: def __init__(self, A, intv, initialize = True, segf = max): self.N = len(A) self.N0 = 2**(self.N-1).bit_length() self.intv = intv self.segf = segf if initialize: self.data = [intv]*self.N0 + A + [intv]*(self.N0 - self.N) for i in range(self.N0-1, 0, -1): self.data[i] = self.segf(self.data[2*i], self.data[2*i+1]) else: self.data = [intv]*(2*self.N0) def update(self, k, x): k += self.N0 self.data[k] = x while k > 0 : k = k >> 1 self.data[k] = self.segf(self.data[2*k], self.data[2*k+1]) def query(self, l, r): L, R = l+self.N0, r+self.N0 s = self.intv while L < R: if R & 1: R -= 1 s = self.segf(s, self.data[R]) if L & 1: s = self.segf(s, self.data[L]) L += 1 L >>= 1 R >>= 1 return s def get(self, x): return self.data[self.N0+x] INF = 10**18 N = int(readline()) ABC = [tuple(map(int, readline().split())) for _ in range(N)] IdxABD = [(i, a, b, b-c) for i, (a, b, c) in enumerate(ABC)] IdxABD.sort(key = itemgetter(3)) Idx, A, B, D = map(list, zip(*IdxABD)) cA = compress(A) sA = sorted(A) aord = [None]*N for j in range(N): aord[cA[j]] = j left = [None]*N for j in range(N): ng = -1 ok = N aj = A[j] while abs(ok-ng) > 1: med = (ok+ng)//2 if D[med] >= aj: ok = med else: ng = med left[j] = ok right = [None]*N for j in range(N): ok = -1 ng = N dj = D[j] while abs(ok-ng) > 1: med = (ok+ng)//2 if sA[med] <= dj: ok = med else: ng = med right[j] = ng atable = Segtree(A, INF, initialize = True, segf = min) valtable = Segtree([0]*N, 0, initialize = False, segf = max) vt = [0]*N Ans = [None]*N ans = [None]*N seen = 0 maxval = 0 for j in range(N): pj = aord[j] ansidx = Idx[pj] if left[pj] <= pj: atable.update(pj, INF) mina = atable.query(left[pj], N) atable.update(pj, A[pj]) else: mina = atable.query(left[pj], N) res = B[pj] if mina <= D[pj]: res = INF inval = False for k in range(seen, left[pj]): if k == pj: inval = True continue elif cA[k] < j: valtable.update(cA[k], ans[k]) else: valtable.update(cA[k], B[k] + maxval) if cA[pj] < right[pj]: cnt = valtable.get(cA[pj]) valtable.update(cA[pj], 0) res = max(res, B[pj] + valtable.query(0, right[pj])) if inval: valtable.update(cA[pj], res) else: valtable.update(cA[pj], cnt) else: res = max(res, B[pj] + valtable.query(0, right[pj])) if inval: valtable.update(cA[pj], res) maxval = max(maxval, res) ans[pj] = res seen = left[pj] if res >= INF: Ans[ansidx] = 'BAN' else: Ans[ansidx] = str(res) print('\n'.join(Ans))