結果
問題 | No.704 ゴミ拾い Medium |
ユーザー | vwxyz |
提出日時 | 2022-10-27 12:52:27 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,158 bytes |
コンパイル時間 | 275 ms |
コンパイル使用メモリ | 87,144 KB |
実行使用メモリ | 187,220 KB |
最終ジャッジ日時 | 2023-09-18 06:36:10 |
合計ジャッジ時間 | 27,481 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 275 ms
94,028 KB |
testcase_01 | AC | 273 ms
94,160 KB |
testcase_02 | AC | 275 ms
94,188 KB |
testcase_03 | AC | 280 ms
96,416 KB |
testcase_04 | AC | 274 ms
94,148 KB |
testcase_05 | AC | 273 ms
94,112 KB |
testcase_06 | WA | - |
testcase_07 | AC | 270 ms
94,432 KB |
testcase_08 | AC | 272 ms
94,260 KB |
testcase_09 | AC | 276 ms
94,156 KB |
testcase_10 | AC | 273 ms
94,128 KB |
testcase_11 | AC | 270 ms
94,104 KB |
testcase_12 | AC | 276 ms
94,204 KB |
testcase_13 | AC | 275 ms
94,148 KB |
testcase_14 | WA | - |
testcase_15 | AC | 317 ms
101,112 KB |
testcase_16 | AC | 321 ms
101,536 KB |
testcase_17 | WA | - |
testcase_18 | AC | 320 ms
101,456 KB |
testcase_19 | AC | 327 ms
101,044 KB |
testcase_20 | AC | 319 ms
101,420 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 319 ms
101,156 KB |
testcase_24 | AC | 807 ms
177,692 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 802 ms
177,332 KB |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 721 ms
186,160 KB |
testcase_37 | WA | - |
testcase_38 | AC | 711 ms
187,220 KB |
testcase_39 | AC | 709 ms
185,704 KB |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | AC | 275 ms
94,088 KB |
testcase_45 | WA | - |
testcase_46 | AC | 662 ms
168,664 KB |
testcase_47 | AC | 676 ms
165,980 KB |
ソースコード
import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write class Segment_Tree: def __init__(self,N,f,e,lst=None,dynamic=False): self.f=f self.e=e self.N=N if dynamic: self.segment_tree=defaultdict(lambda:self.e) else: if lst==None: self.segment_tree=[self.e]*2*self.N else: assert len(lst)<=self.N self.segment_tree=[self.e]*self.N+[x for x in lst]+[self.e]*(N-len(lst)) for i in range(self.N-1,0,-1): self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1]) def __getitem__(self,i): if type(i)==int: if -self.N<=i<0: return self.segment_tree[i+self.N*2] elif 0<=i<self.N: return self.segment_tree[i+self.N] else: raise IndexError("list index out of range") else: a,b,c=i.start,i.stop,i.step if a==None: a=self.N else: a+=self.N if b==None: b=self.N*2 else: b+=self.N return self.segment_tree[slice(a,b,c)] def __setitem__(self,i,x): if -self.N<=i<0: i+=self.N*2 elif 0<=i<self.N: i+=self.N else: raise IndexError("list index out of range") self.segment_tree[i]=x while i>1: i>>= 1 self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1]) def Build(self,lst): for i,x in enumerate(lst,self.N): self.segment_tree[i]=x for i in range(self.N-1,0,-1): self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1]) def Fold(self,L=None,R=None): if L==None: L=self.N else: L+=self.N if R==None: R=self.N*2 else: R+=self.N vL=self.e vR=self.e while L<R: if L&1: vL=self.f(vL,self.segment_tree[L]) L+=1 if R&1: R-=1 vR=self.f(self.segment_tree[R],vR) L>>=1 R>>=1 return self.f(vL,vR) def Fold_Index(self,L=None,R=None): if L==None: L=self.N else: L+=self.N if R==None: R=self.N*2 else: R+=self.N if L==R: return None x=self.Fold(L-self.N,R-self.N) while L<R: if L&1: if self.segment_tree[L]==x: i=L break L+=1 if R&1: R-=1 if self.segment_tree[R]==x: i=R break L>>=1 R>>=1 while i<self.N: if self.segment_tree[i]==self.segment_tree[i<<1]: i<<=1 else: i<<=1 i|=1 i-=self.N return i def Bisect_Right(self,L=None,f=None): if L==self.N: return self.N if L==None: L=0 L+=self.N vl=self.e vr=self.e l,r=L,self.N*2 while l<r: if l&1: vl=self.f(vl,self.segment_tree[l]) l+=1 if r&1: r-=1 vr=self.f(self.segment_tree[r],vr) l>>=1 r>>=1 if f(self.f(vl,vr)): return self.N v=self.e while True: while L%2==0: L>>=1 vv=self.f(v,self.segment_tree[L]) if f(vv): v=vv L+=1 else: while L<self.N: L<<=1 vv=self.f(v,self.segment_tree[L]) if f(vv): v=vv L+=1 return L-self.N def Bisect_Left(self,R=None,f=None): if R==0: return 0 if R==None: R=self.N R+=self.N vl=self.e vr=self.e l,r=self.N,R while l<r: if l&1: vl=self.f(vl,self.segment_tree[l]) l+=1 if r&1: r-=1 vr=self.f(self.segment_tree[r],vr) l>>=1 r>>=1 if f(self.f(vl,vr)): return 0 v=self.e while True: R-=1 while R>1 and R%2: R>>=1 vv=self.f(self.segment_tree[R],v) if f(vv): v=vv else: while R<self.N: R=2*R+1 vv=self.f(self.segment_tree[R],v) if f(vv): v=vv R-=1 return R+1-self.N def __str__(self): return "["+", ".join(map(str,self.segment_tree[self.N:]))+"]" N=int(readline()) A=list(map(int,readline().split())) X=list(map(int,readline().split())) Y=list(map(int,readline().split())) M=max(A)+1 inf=1<<60 ST0=Segment_Tree(M+1,min,inf) ST1=Segment_Tree(M+1,min,inf) dp=[inf]*(N+1) dp[0]=0 for i in range(1,N+1): a,x,y=A[i-1],X[i-1],Y[i-1] ST0[a]=min(ST0[a],dp[i-1]-x+y) ST1[a]=min(ST1[a],dp[i-1]+x+y) dp[i]=min(ST0.Fold(0,a+1)+a,ST1.Fold(a+1,M+1)-a) ans=dp[N] print(ans)