結果
問題 | No.489 株に挑戦 |
ユーザー | lloyz |
提出日時 | 2023-01-23 00:00:29 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,258 bytes |
コンパイル時間 | 677 ms |
コンパイル使用メモリ | 87,012 KB |
実行使用メモリ | 105,100 KB |
最終ジャッジ日時 | 2023-09-07 07:08:02 |
合計ジャッジ時間 | 9,249 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 230 ms
98,608 KB |
testcase_01 | WA | - |
testcase_02 | AC | 91 ms
71,584 KB |
testcase_03 | AC | 91 ms
71,896 KB |
testcase_04 | AC | 91 ms
71,528 KB |
testcase_05 | AC | 91 ms
71,608 KB |
testcase_06 | AC | 94 ms
72,564 KB |
testcase_07 | AC | 94 ms
72,296 KB |
testcase_08 | AC | 96 ms
71,588 KB |
testcase_09 | AC | 100 ms
72,300 KB |
testcase_10 | AC | 94 ms
72,044 KB |
testcase_11 | AC | 94 ms
72,364 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 94 ms
72,368 KB |
testcase_15 | AC | 161 ms
79,488 KB |
testcase_16 | AC | 210 ms
83,220 KB |
testcase_17 | AC | 146 ms
79,596 KB |
testcase_18 | AC | 202 ms
81,856 KB |
testcase_19 | WA | - |
testcase_20 | AC | 234 ms
102,064 KB |
testcase_21 | AC | 172 ms
83,424 KB |
testcase_22 | AC | 158 ms
79,708 KB |
testcase_23 | AC | 204 ms
92,668 KB |
testcase_24 | WA | - |
testcase_25 | AC | 95 ms
72,204 KB |
testcase_26 | AC | 205 ms
105,100 KB |
testcase_27 | AC | 198 ms
86,560 KB |
testcase_28 | AC | 90 ms
71,688 KB |
testcase_29 | AC | 93 ms
71,840 KB |
testcase_30 | WA | - |
testcase_31 | AC | 186 ms
104,732 KB |
testcase_32 | AC | 210 ms
92,656 KB |
testcase_33 | AC | 245 ms
102,996 KB |
testcase_34 | WA | - |
testcase_35 | AC | 191 ms
86,776 KB |
testcase_36 | AC | 163 ms
81,060 KB |
testcase_37 | AC | 187 ms
91,396 KB |
ソースコード
class SegmentTree: __all__ = ['setval', 'pointupdate', 'segquery', 'segsearch_right', 'pointgetval'] def __init__(self, n=10**6, idetify_elt=-10**9, func=max): assert (func(idetify_elt, idetify_elt) == idetify_elt) self._n = n self._seg_length_half = 2**(n-1).bit_length() self._idetify_elt = idetify_elt self._seg = [idetify_elt]*(2*self._seg_length_half) self._func = func def setval(self, x_list): '''Set value : A = x_list''' assert (len(x_list) == self._n) # Set value at the bottom for i in range(self._n): self._seg[i+self._seg_length_half-1] = x_list[i] # Build value for i in range(self._seg_length_half-2, -1, -1): self._seg[i] = self._func(self._seg[2*i+1], self._seg[2*i+2]) def pointupdate(self, k, x): '''Update : A[k] = x ''' pos = k + self._seg_length_half - 1 # Set value at k-th self._seg[pos] = x # Build bottom-up while pos: pos = (pos-1)//2 self._seg[pos] = self._func(self._seg[pos*2+1], self._seg[pos*2+2]) def pointgetval(self, k): ''' Return A[k] ''' return self._seg[k + self._seg_length_half - 1] def segquery(self, left, right): ''' Return func(A[left], ... , A[right-1]) ''' # if not left < right if right <= left: return self._idetify_elt func_value = self._idetify_elt leftpos = left + self._seg_length_half - 1 # leftmost segment rightpos = right + self._seg_length_half - 2 # rightmost segment while leftpos < rightpos-1: if leftpos&1 == 0: # if leftpos is right-child func_value = self._func(func_value, self._seg[leftpos]) if rightpos&1 == 1: # if rightpos is leftchild func_value = self._func(func_value, self._seg[rightpos]) rightpos -= 1 # move up leftpos = leftpos//2 rightpos = (rightpos-1)//2 func_value = self._func(func_value, self._seg[leftpos]) if leftpos != rightpos: func_value = self._func(func_value, self._seg[rightpos]) return func_value def segsearch_right(self, condfunc, left=0): ''' Return min_i satisfying condfunc( func( A[left], ... , A[i])) if impossible : return n ''' # if impossible (ie. condfunc( func( A[left], ... , A[-1])) is False) if not condfunc(self._segquery(left, self._n)): return self._n # possible func_value = self._idetify_elt rightpos = left + self._seg_length_half - 1 while True: # while rightpos is the left-child, move bottom-up while rightpos&1 == 1: rightpos //= 2 # try up_value_trial = self._func(func_value, self._seg[rightpos]) if not condfunc(up_value_trial): # move up and right func_value = up_value_trial rightpos = (rightpos-1)//2 + 1 else: # move top-down while rightpos < self._seg_length_half-1: down_value_trial = self._func(func_value, self._seg[rightpos*2 + 1]) if condfunc(down_value_trial): # move left-child rightpos = rightpos*2 + 1 else: # move right-child func_value = down_value_trial rightpos = rightpos*2 + 2 return rightpos - self._seg_length_half + 1 from collections import defaultdict from bisect import bisect_left n, d, k = map(int, input().split()) X = [int(input()) for _ in range(n)] Idxs = defaultdict(list) for i in range(n): Idxs[X[i]].append(i) SegTree = SegmentTree(n) SegTree.setval(X) ans = 0 ANS = [0, 0] for i in range(n - d): max_ = SegTree.segquery(i, i + d + 1) res = (max_ - X[i]) * k if res > ans: ans = res idx = bisect_left(Idxs[max_], i) ANS = [i, Idxs[max_][idx]] print(ans) if ans != 0: print(*ANS)