結果
問題 | No.704 ゴミ拾い Medium |
ユーザー | tpyneriver |
提出日時 | 2019-07-05 19:57:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 784 ms / 1,500 ms |
コード長 | 2,842 bytes |
コンパイル時間 | 427 ms |
コンパイル使用メモリ | 81,676 KB |
実行使用メモリ | 186,552 KB |
最終ジャッジ日時 | 2023-10-22 03:22:12 |
合計ジャッジ時間 | 17,579 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge10 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
53,376 KB |
testcase_01 | AC | 39 ms
53,376 KB |
testcase_02 | AC | 43 ms
53,376 KB |
testcase_03 | AC | 80 ms
87,052 KB |
testcase_04 | AC | 40 ms
53,376 KB |
testcase_05 | AC | 41 ms
53,376 KB |
testcase_06 | AC | 41 ms
53,376 KB |
testcase_07 | AC | 43 ms
53,376 KB |
testcase_08 | AC | 41 ms
53,376 KB |
testcase_09 | AC | 39 ms
53,376 KB |
testcase_10 | AC | 40 ms
53,376 KB |
testcase_11 | AC | 39 ms
53,376 KB |
testcase_12 | AC | 41 ms
53,376 KB |
testcase_13 | AC | 39 ms
53,376 KB |
testcase_14 | AC | 138 ms
104,276 KB |
testcase_15 | AC | 130 ms
103,748 KB |
testcase_16 | AC | 134 ms
103,484 KB |
testcase_17 | AC | 135 ms
104,012 KB |
testcase_18 | AC | 135 ms
104,276 KB |
testcase_19 | AC | 131 ms
103,748 KB |
testcase_20 | AC | 134 ms
104,012 KB |
testcase_21 | AC | 132 ms
103,688 KB |
testcase_22 | AC | 135 ms
104,012 KB |
testcase_23 | AC | 134 ms
103,748 KB |
testcase_24 | AC | 715 ms
181,864 KB |
testcase_25 | AC | 784 ms
181,792 KB |
testcase_26 | AC | 740 ms
182,464 KB |
testcase_27 | AC | 645 ms
181,952 KB |
testcase_28 | AC | 754 ms
182,552 KB |
testcase_29 | AC | 716 ms
181,996 KB |
testcase_30 | AC | 760 ms
182,440 KB |
testcase_31 | AC | 736 ms
182,980 KB |
testcase_32 | AC | 631 ms
182,452 KB |
testcase_33 | AC | 739 ms
182,376 KB |
testcase_34 | AC | 403 ms
186,468 KB |
testcase_35 | AC | 406 ms
186,068 KB |
testcase_36 | AC | 407 ms
186,076 KB |
testcase_37 | AC | 406 ms
186,084 KB |
testcase_38 | AC | 401 ms
186,128 KB |
testcase_39 | AC | 402 ms
186,412 KB |
testcase_40 | AC | 404 ms
186,552 KB |
testcase_41 | AC | 403 ms
186,100 KB |
testcase_42 | AC | 404 ms
186,276 KB |
testcase_43 | AC | 400 ms
186,044 KB |
testcase_44 | AC | 38 ms
53,376 KB |
testcase_45 | AC | 73 ms
90,304 KB |
testcase_46 | AC | 444 ms
186,020 KB |
testcase_47 | AC | 589 ms
183,168 KB |
ソースコード
class Lichaotree: #区間は1-indexed #min def __init__(self, X): self.N = len(X) self.N0 = 2**(self.N-1).bit_length() self.comp = {v : k for k, v in enumerate(X)} self.inf = 10**12 self.X = X + [self.inf]*(self.N0 - self.N) self.data = [None]*(2*self.N0) self.size = [0]*self.N0 + [1]*self.N0 for i in range(self.N0-1, 0, -1): self.size[i] = 2*self.size[2*i] self.start = [0]*(2*self.N0) for i in range(2, 2*self.N0): if i & 1: self.start[i] = self.start[i>>1] + self.size[i] else: self.start[i] = self.start[i>>1] def f(self, line, x): return line[0]*x + line[1] def _update(self, k, line): if self.data[k] is None: self.data[k] = line return l = self.start[k] r = l + self.size[k] while True: if self.data[k] is None: self.data[k] = line return m = (l+r)//2 lx = self.X[l] mx = self.X[m] rx = self.X[r-1] gl = (self.f(self.data[k], lx) > self.f(line, lx)) gm = (self.f(self.data[k], mx) > self.f(line, mx)) gr = (self.f(self.data[k], rx) > self.f(line, rx)) if gl and gr: self.data[k] = line return if not gl and not gr: return if gm: self.data[k], line = line, self.data[k] gl = not gl if gl: r = m k = 2*k else: l = m k = 2*k+1 def query(self, x): k = self.comp[x] + self.N0 s = self.inf while k > 0: if self.data[k]: s = min(s, self.f(self.data[k], x)) k = k >> 1 return s def addline(self, line): self._update(1, line) def addlineseg(self, l, r, line): #区間[l, r)にlineを追加,l, rはXの元 L = l+self.N0 R = r+self.N0 while L < R: if R & 1: R -= 1 self._update(R, line) if L & 1: self._update(L, line) L += 1 L >>= 1 R >>= 1 N = int(input()) A = list(map(int, input().split())) X = list(map(int, input().split())) Y = list(map(int, input().split())) mX = max(X+A) T = Lichaotree(list(range(mX + 1))) N0 = T.N0 dp = [0]*N for i in range(N): T.addlineseg(0, X[i], (-1, X[i] + Y[i] + dp[i-1])) T.addlineseg(X[i], N0, (1, -X[i] + Y[i] + dp[i-1])) dp[i] = T.query(A[i]) print(dp[-1])