結果
問題 | No.2808 Concentration |
ユーザー | hirayuu_yc |
提出日時 | 2024-07-08 18:12:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 541 ms / 2,000 ms |
コード長 | 4,295 bytes |
コンパイル時間 | 343 ms |
コンパイル使用メモリ | 82,128 KB |
実行使用メモリ | 137,600 KB |
最終ジャッジ日時 | 2024-07-10 15:19:51 |
合計ジャッジ時間 | 24,185 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 507 ms
133,328 KB |
testcase_01 | AC | 541 ms
133,504 KB |
testcase_02 | AC | 536 ms
133,356 KB |
testcase_03 | AC | 58 ms
67,776 KB |
testcase_04 | AC | 58 ms
67,608 KB |
testcase_05 | AC | 59 ms
67,456 KB |
testcase_06 | AC | 307 ms
105,064 KB |
testcase_07 | AC | 219 ms
89,476 KB |
testcase_08 | AC | 123 ms
79,360 KB |
testcase_09 | AC | 386 ms
121,152 KB |
testcase_10 | AC | 385 ms
112,000 KB |
testcase_11 | AC | 252 ms
95,744 KB |
testcase_12 | AC | 476 ms
128,848 KB |
testcase_13 | AC | 215 ms
86,616 KB |
testcase_14 | AC | 466 ms
135,472 KB |
testcase_15 | AC | 456 ms
125,428 KB |
testcase_16 | AC | 493 ms
137,320 KB |
testcase_17 | AC | 503 ms
133,152 KB |
testcase_18 | AC | 342 ms
109,084 KB |
testcase_19 | AC | 471 ms
135,196 KB |
testcase_20 | AC | 437 ms
125,836 KB |
testcase_21 | AC | 371 ms
112,384 KB |
testcase_22 | AC | 343 ms
114,944 KB |
testcase_23 | AC | 478 ms
137,600 KB |
testcase_24 | AC | 341 ms
110,208 KB |
testcase_25 | AC | 483 ms
135,096 KB |
testcase_26 | AC | 504 ms
133,504 KB |
testcase_27 | AC | 496 ms
133,320 KB |
testcase_28 | AC | 494 ms
133,632 KB |
testcase_29 | AC | 494 ms
133,480 KB |
testcase_30 | AC | 491 ms
133,776 KB |
testcase_31 | AC | 510 ms
133,760 KB |
testcase_32 | AC | 504 ms
133,120 KB |
testcase_33 | AC | 501 ms
133,760 KB |
testcase_34 | AC | 497 ms
133,120 KB |
testcase_35 | AC | 504 ms
133,760 KB |
testcase_36 | AC | 507 ms
133,636 KB |
testcase_37 | AC | 498 ms
133,632 KB |
testcase_38 | AC | 518 ms
133,752 KB |
testcase_39 | AC | 509 ms
133,248 KB |
testcase_40 | AC | 495 ms
133,560 KB |
testcase_41 | AC | 509 ms
133,760 KB |
testcase_42 | AC | 514 ms
133,824 KB |
testcase_43 | AC | 496 ms
133,268 KB |
testcase_44 | AC | 496 ms
133,500 KB |
testcase_45 | AC | 499 ms
133,504 KB |
testcase_46 | AC | 58 ms
68,736 KB |
testcase_47 | AC | 55 ms
68,224 KB |
testcase_48 | AC | 56 ms
67,840 KB |
testcase_49 | AC | 57 ms
67,968 KB |
testcase_50 | AC | 57 ms
67,712 KB |
testcase_51 | AC | 58 ms
67,584 KB |
testcase_52 | AC | 60 ms
68,224 KB |
testcase_53 | AC | 57 ms
67,712 KB |
testcase_54 | AC | 57 ms
67,456 KB |
testcase_55 | AC | 58 ms
67,456 KB |
ソースコード
#https://github.com/not522/ac-library-python/tree/master import typing def _ceil_pow2(n: int) -> int: x = 0 while (1 << x) < n: x += 1 return x def _bsf(n: int) -> int: x = 0 while n % 2 == 0: x += 1 n //= 2 return x class SegTree: def __init__(self, op: typing.Callable[[typing.Any, typing.Any], typing.Any], e: typing.Any, v: typing.Union[int, typing.List[typing.Any]]) -> None: self._op = op self._e = e if isinstance(v, int): v = [e] * v self._n = len(v) self._log = _ceil_pow2(self._n) self._size = 1 << self._log self._d = [e] * (2 * self._size) for i in range(self._n): self._d[self._size + i] = v[i] for i in range(self._size - 1, 0, -1): self._update(i) def set(self, p: int, x: typing.Any) -> None: assert 0 <= p < self._n p += self._size self._d[p] = x for i in range(1, self._log + 1): self._update(p >> i) def get(self, p: int) -> typing.Any: assert 0 <= p < self._n return self._d[p + self._size] def prod(self, left: int, right: int) -> typing.Any: assert 0 <= left <= right <= self._n sml = self._e smr = self._e left += self._size right += self._size while left < right: if left & 1: sml = self._op(sml, self._d[left]) left += 1 if right & 1: right -= 1 smr = self._op(self._d[right], smr) left >>= 1 right >>= 1 return self._op(sml, smr) def all_prod(self) -> typing.Any: return self._d[1] def max_right(self, left: int, f: typing.Callable[[typing.Any], bool]) -> int: assert 0 <= left <= self._n assert f(self._e) if left == self._n: return self._n left += self._size sm = self._e first = True while first or (left & -left) != left: first = False while left % 2 == 0: left >>= 1 if not f(self._op(sm, self._d[left])): while left < self._size: left *= 2 if f(self._op(sm, self._d[left])): sm = self._op(sm, self._d[left]) left += 1 return left - self._size sm = self._op(sm, self._d[left]) left += 1 return self._n def min_left(self, right: int, f: typing.Callable[[typing.Any], bool]) -> int: assert 0 <= right <= self._n assert f(self._e) if right == 0: return 0 right += self._size sm = self._e first = True while first or (right & -right) != right: first = False right -= 1 while right > 1 and right % 2: right >>= 1 if not f(self._op(self._d[right], sm)): while right < self._size: right = 2 * right + 1 if f(self._op(self._d[right], sm)): sm = self._op(self._d[right], sm) right -= 1 return right + 1 - self._size sm = self._op(self._d[right], sm) return 0 def _update(self, k: int) -> None: self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1]) N,S,H=map(int,input().split()) segs=[(-(1<<60),-(1<<60),0)]+[tuple(map(int,input().split())) for i in range(N)]+[(1<<60,1<<60,0)] segs=[(x,y,z) for x,y,z in segs if y-x<=S] N=len(segs) last_sleep=[-1]*N pnt=0 for i in range(1,N): while segs[i][0]-segs[pnt+1][1]>=H: pnt+=1 last_sleep[i]=pnt last_listen=[-1]*N pnt=0 for i in range(1,N): while segs[i][1]-segs[pnt][0]>S: pnt+=1 last_listen[i]=pnt cum=[0]*N for i in range(1,N): cum[i]=cum[i-1]+segs[i][2] sleep_dp=[0]*N listen_dp=SegTree(lambda x,y:max(x,y),-(1<<60),[0]*N) for i in range(1,N): listen_dp.set(i,sleep_dp[last_sleep[i]]-cum[i-1]) sleep_dp[i]=max(sleep_dp[i-1],listen_dp.prod(last_listen[i],i+1)+cum[i]) print(sleep_dp[-1])