結果
問題 | No.1209 XOR Into You |
ユーザー | vwxyz |
提出日時 | 2023-03-31 14:33:50 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 836 ms / 2,000 ms |
コード長 | 6,221 bytes |
コンパイル時間 | 469 ms |
コンパイル使用メモリ | 82,108 KB |
実行使用メモリ | 163,728 KB |
最終ジャッジ日時 | 2024-09-22 18:51:06 |
合計ジャッジ時間 | 25,063 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
53,504 KB |
testcase_01 | AC | 41 ms
53,632 KB |
testcase_02 | AC | 42 ms
53,632 KB |
testcase_03 | AC | 41 ms
53,376 KB |
testcase_04 | AC | 93 ms
91,392 KB |
testcase_05 | AC | 94 ms
91,648 KB |
testcase_06 | AC | 132 ms
94,528 KB |
testcase_07 | AC | 763 ms
163,728 KB |
testcase_08 | AC | 662 ms
140,292 KB |
testcase_09 | AC | 670 ms
140,160 KB |
testcase_10 | AC | 544 ms
136,120 KB |
testcase_11 | AC | 640 ms
130,756 KB |
testcase_12 | AC | 607 ms
124,992 KB |
testcase_13 | AC | 687 ms
141,536 KB |
testcase_14 | AC | 598 ms
141,728 KB |
testcase_15 | AC | 624 ms
136,384 KB |
testcase_16 | AC | 604 ms
130,736 KB |
testcase_17 | AC | 583 ms
141,744 KB |
testcase_18 | AC | 836 ms
157,980 KB |
testcase_19 | AC | 604 ms
131,132 KB |
testcase_20 | AC | 672 ms
140,724 KB |
testcase_21 | AC | 524 ms
125,888 KB |
testcase_22 | AC | 340 ms
154,612 KB |
testcase_23 | AC | 340 ms
154,084 KB |
testcase_24 | AC | 339 ms
154,216 KB |
testcase_25 | AC | 807 ms
147,156 KB |
testcase_26 | AC | 799 ms
147,656 KB |
testcase_27 | AC | 807 ms
147,580 KB |
testcase_28 | AC | 792 ms
147,136 KB |
testcase_29 | AC | 795 ms
146,860 KB |
testcase_30 | AC | 808 ms
147,048 KB |
testcase_31 | AC | 785 ms
159,468 KB |
testcase_32 | AC | 782 ms
159,384 KB |
testcase_33 | AC | 791 ms
159,492 KB |
testcase_34 | AC | 798 ms
158,712 KB |
testcase_35 | AC | 798 ms
159,272 KB |
testcase_36 | AC | 797 ms
159,904 KB |
testcase_37 | AC | 340 ms
154,276 KB |
testcase_38 | AC | 689 ms
162,732 KB |
testcase_39 | AC | 606 ms
138,316 KB |
testcase_40 | AC | 343 ms
154,216 KB |
ソースコード
import sys readline=sys.stdin.readline def Inversion_Number(lst,weight=False,weakly=False): compress,decompress=Compress(lst) compressed_lst=[compress[x] for x in lst] N=len(compress) if not weight: weight=[1]*len(lst) ST=Segment_Tree(N,lambda x,y:x+y,0) inversion_number=0 for c,x in zip(weight,compressed_lst): inversion_number+=ST.Fold(x if weakly else x+1,N)*c ST[x]+=c return inversion_number def Compress(lst): decomp=sorted(list(set(lst))) comp={x:i for i,x in enumerate(decomp)} return comp,decomp 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())) B=list(map(int,readline().split())) if A[0]!=B[0]: print(-1) exit() A=[A[i]^A[i+1] for i in range(N-1)] B=[B[i]^B[i+1] for i in range(N-1)] N-=1 if sorted(A)==sorted(B): idxA={tpl:i for i,tpl in enumerate(sorted([(A[i],i) for i in range(N)]))} idxB={tpl:i for i,tpl in enumerate(sorted([(B[i],i) for i in range(N)]))} for i in range(N): A[i]=idxA[(A[i],i)] B[i]=idxB[(B[i],i)] idx={A[i]:i for i in range(N)} for i in range(N): B[i]=idx[B[i]] ans=Inversion_Number(B) else: ans=-1 print(ans)