結果
問題 | No.808 Kaiten Sushi? |
ユーザー | vwxyz |
提出日時 | 2024-04-08 09:15:49 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,071 ms / 2,000 ms |
コード長 | 5,990 bytes |
コンパイル時間 | 3,295 ms |
コンパイル使用メモリ | 81,572 KB |
実行使用メモリ | 174,644 KB |
最終ジャッジ日時 | 2024-04-08 09:17:07 |
合計ジャッジ時間 | 34,592 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
55,604 KB |
testcase_01 | AC | 46 ms
63,652 KB |
testcase_02 | AC | 41 ms
55,604 KB |
testcase_03 | AC | 40 ms
55,604 KB |
testcase_04 | AC | 40 ms
55,604 KB |
testcase_05 | AC | 41 ms
55,604 KB |
testcase_06 | AC | 43 ms
60,768 KB |
testcase_07 | AC | 149 ms
78,108 KB |
testcase_08 | AC | 152 ms
78,116 KB |
testcase_09 | AC | 203 ms
79,012 KB |
testcase_10 | AC | 184 ms
78,576 KB |
testcase_11 | AC | 194 ms
78,264 KB |
testcase_12 | AC | 182 ms
78,348 KB |
testcase_13 | AC | 177 ms
78,164 KB |
testcase_14 | AC | 122 ms
76,920 KB |
testcase_15 | AC | 204 ms
79,024 KB |
testcase_16 | AC | 187 ms
78,472 KB |
testcase_17 | AC | 133 ms
77,168 KB |
testcase_18 | AC | 113 ms
76,668 KB |
testcase_19 | AC | 89 ms
75,912 KB |
testcase_20 | AC | 124 ms
76,660 KB |
testcase_21 | AC | 94 ms
75,900 KB |
testcase_22 | AC | 121 ms
76,808 KB |
testcase_23 | AC | 347 ms
98,668 KB |
testcase_24 | AC | 318 ms
104,640 KB |
testcase_25 | AC | 317 ms
104,520 KB |
testcase_26 | AC | 310 ms
103,100 KB |
testcase_27 | AC | 795 ms
157,420 KB |
testcase_28 | AC | 415 ms
98,820 KB |
testcase_29 | AC | 742 ms
148,984 KB |
testcase_30 | AC | 566 ms
107,700 KB |
testcase_31 | AC | 790 ms
159,212 KB |
testcase_32 | AC | 865 ms
174,144 KB |
testcase_33 | AC | 560 ms
105,844 KB |
testcase_34 | AC | 622 ms
123,164 KB |
testcase_35 | AC | 690 ms
138,664 KB |
testcase_36 | AC | 554 ms
105,852 KB |
testcase_37 | AC | 41 ms
55,604 KB |
testcase_38 | AC | 40 ms
55,604 KB |
testcase_39 | AC | 1,010 ms
164,600 KB |
testcase_40 | AC | 404 ms
94,676 KB |
testcase_41 | AC | 412 ms
97,932 KB |
testcase_42 | AC | 837 ms
147,704 KB |
testcase_43 | AC | 463 ms
104,056 KB |
testcase_44 | AC | 673 ms
123,100 KB |
testcase_45 | AC | 479 ms
102,928 KB |
testcase_46 | AC | 359 ms
90,060 KB |
testcase_47 | AC | 1,044 ms
174,640 KB |
testcase_48 | AC | 1,055 ms
174,640 KB |
testcase_49 | AC | 1,033 ms
174,644 KB |
testcase_50 | AC | 1,071 ms
174,644 KB |
testcase_51 | AC | 1,056 ms
174,640 KB |
testcase_52 | AC | 650 ms
139,880 KB |
testcase_53 | AC | 841 ms
174,068 KB |
testcase_54 | AC | 41 ms
55,604 KB |
testcase_55 | AC | 42 ms
55,604 KB |
testcase_56 | AC | 40 ms
55,604 KB |
testcase_57 | AC | 389 ms
108,384 KB |
testcase_58 | AC | 535 ms
117,812 KB |
ソースコード
from collections import defaultdict 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:]))+"]" def Compress(lst): decomp=sorted(list(set(lst))) comp={x:i for i,x in enumerate(decomp)} return comp,decomp N,L=map(int,input().split()) X=list(map(int,input().split())) Y=list(map(int,input().split())) XY=[0]+X+Y comp,decomp=Compress(XY) le=len(comp) STX=Segment_Tree(2*le,lambda x,y:x+y,0) for x in X: STX[comp[x]]+=1 STX[comp[x]+le]+=1 STY=Segment_Tree(2*le,lambda x,y:x+y,0) for y in Y: STY[comp[y]]+=1 STY[comp[y]+le]+=1 cur=0 ans=0 x=STX.Bisect_Right(0,lambda s:s==0) ans=decomp[x] STX[x]=0 STX[x+le]=0 for _ in range(N-1): prev=x y=STY.Bisect_Right((x+1)%le,lambda s:s==0)%le x=STX.Bisect_Right((y+1)%le,lambda s:s==0)%le y=(STY.Bisect_Left(x+le,lambda s:s==0)-1)%le ans+=(decomp[x]-decomp[y])%L+(decomp[y]-decomp[prev])%L STX[x]=0 STX[x+le]=0 STY[y]=0 STY[y+le]=0 y=STY.Bisect_Right(0,lambda s:s==0) ans+=(decomp[y]-decomp[x])%L print(ans)