結果
問題 | No.704 ゴミ拾い Medium |
ユーザー | tpyneriver |
提出日時 | 2019-07-05 18:53:23 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,759 bytes |
コンパイル時間 | 605 ms |
コンパイル使用メモリ | 81,452 KB |
実行使用メモリ | 184,456 KB |
最終ジャッジ日時 | 2023-10-22 02:05:54 |
合計ジャッジ時間 | 23,111 ms |
ジャッジサーバーID (参考情報) |
judge10 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
52,324 KB |
testcase_01 | AC | 41 ms
52,324 KB |
testcase_02 | AC | 42 ms
52,328 KB |
testcase_03 | AC | 96 ms
82,220 KB |
testcase_04 | AC | 43 ms
52,404 KB |
testcase_05 | AC | 41 ms
52,416 KB |
testcase_06 | AC | 42 ms
52,420 KB |
testcase_07 | AC | 41 ms
52,412 KB |
testcase_08 | AC | 41 ms
52,432 KB |
testcase_09 | AC | 42 ms
52,416 KB |
testcase_10 | AC | 41 ms
52,424 KB |
testcase_11 | AC | 41 ms
52,424 KB |
testcase_12 | AC | 41 ms
52,412 KB |
testcase_13 | WA | - |
testcase_14 | AC | 170 ms
101,360 KB |
testcase_15 | AC | 219 ms
101,640 KB |
testcase_16 | AC | 157 ms
101,840 KB |
testcase_17 | AC | 156 ms
101,524 KB |
testcase_18 | AC | 158 ms
101,576 KB |
testcase_19 | AC | 153 ms
101,520 KB |
testcase_20 | AC | 152 ms
101,576 KB |
testcase_21 | AC | 159 ms
101,572 KB |
testcase_22 | AC | 162 ms
102,100 KB |
testcase_23 | AC | 142 ms
101,520 KB |
testcase_24 | AC | 885 ms
180,096 KB |
testcase_25 | AC | 944 ms
179,848 KB |
testcase_26 | AC | 952 ms
180,404 KB |
testcase_27 | AC | 908 ms
180,068 KB |
testcase_28 | AC | 943 ms
180,640 KB |
testcase_29 | AC | 911 ms
180,028 KB |
testcase_30 | AC | 872 ms
180,504 KB |
testcase_31 | AC | 961 ms
181,040 KB |
testcase_32 | AC | 934 ms
180,504 KB |
testcase_33 | AC | 826 ms
180,388 KB |
testcase_34 | AC | 468 ms
184,356 KB |
testcase_35 | AC | 459 ms
183,944 KB |
testcase_36 | AC | 456 ms
183,956 KB |
testcase_37 | AC | 464 ms
183,956 KB |
testcase_38 | AC | 449 ms
184,012 KB |
testcase_39 | AC | 435 ms
184,040 KB |
testcase_40 | AC | 464 ms
184,456 KB |
testcase_41 | AC | 471 ms
184,012 KB |
testcase_42 | AC | 466 ms
184,184 KB |
testcase_43 | AC | 462 ms
183,944 KB |
testcase_44 | AC | 39 ms
53,428 KB |
testcase_45 | AC | 68 ms
86,040 KB |
testcase_46 | AC | 483 ms
183,884 KB |
testcase_47 | AC | 484 ms
181,024 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] 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 = k - (1 << (k.bit_length() - 1)) 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 = self.comp[l]+self.N0 R = self.comp[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 + 2))) dp = [10**12]*N dp[0] = abs(X[0] - A[0]) + Y[0] T.addlineseg(0, X[0], (-1, X[0]+Y[0])) T.addlineseg(X[0], mX+1, (1, -X[0]+Y[0])) for i in range(1, N): dp[i] = T.query(A[i]) T.addlineseg(0, X[i], (-1, X[i] + Y[i] + dp[i-1])) T.addlineseg(X[i], mX+1, (1, -X[i] + Y[i] + dp[i-1])) print(dp[-1])