結果
問題 | No.694 square1001 and Permutation 3 |
ユーザー |
![]() |
提出日時 | 2023-12-01 20:59:00 |
言語 | PyPy2 (7.3.15) |
結果 |
AC
|
実行時間 | 821 ms / 3,000 ms |
コード長 | 10,513 bytes |
コンパイル時間 | 302 ms |
コンパイル使用メモリ | 76,960 KB |
実行使用メモリ | 194,320 KB |
最終ジャッジ日時 | 2024-09-26 15:52:00 |
合計ジャッジ時間 | 6,649 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 13 |
ソースコード
import sysreadline=sys.stdin.readlinefrom collections import defaultdict,Counterclass Graph:def __init__(self,V,edges=None,graph=None,directed=False,weighted=False,inf=float("inf")):self.V=Vself.directed=directedself.weighted=weightedself.inf=infif graph!=None:self.graph=graph"""self.edges=[]for i in range(self.V):if self.weighted:for j,d in self.graph[i]:if self.directed or not self.directed and i<=j:self.edges.append((i,j,d))else:for j in self.graph[i]:if self.directed or not self.directed and i<=j:self.edges.append((i,j))"""else:self.edges=edgesself.graph=[[] for i in range(self.V)]if weighted:for i,j,d in self.edges:self.graph[i].append((j,d))if not self.directed:self.graph[j].append((i,d))else:for i,j in self.edges:self.graph[i].append(j)if not self.directed:self.graph[j].append(i)def Warshall_Floyd(self,route_restoration=False):dist=[[self.inf]*self.V for i in range(self.V)]for i in range(self.V):dist[i][i]=0if route_restoration:parents=[[j for j in range(self.V)] for i in range(self.V)]for i,j,d in self.edges:if i==j:continueif dist[i][j]>d:dist[i][j]=dif route_restoration:parents[i][j]=iif not self.directed and dist[j][i]>d:dist[j][i]=dif route_restoration:parents[j][i]=jfor k in range(self.V):for i in range(self.V):for j in range(self.V):if dist[i][j]>dist[i][k]+dist[k][j]:dist[i][j]=dist[i][k]+dist[k][j]if route_restoration:parents[i][j]=parents[k][j]for i in range(self.V):if dist[i][i]<0:for j in range(self.V):if dist[i][j]!=self.inf:dist[i][j]=-self.infif route_restoration:for i in range(self.V):if dist[i][i]==0:parents[i][i]=Nonereturn dist,parentselse:return distdef Kruskal(self,maximize=False,spanning_tree=False):UF=UnionFind(self.V)sorted_edges=sorted(self.edges if self.weighted else [(x,y,1) for x,y in self.edges],key=lambda tpl:tpl[2],reverse=maximize)if spanning_tree:st=[]else:cost=0for x,y,d in sorted_edges:if not UF.Same(x,y):UF.Union(x,y)if spanning_tree:st.append((x,y,d))else:cost+=dreturn st if spanning_tree else costdef 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=0for c,x in zip(weight,compressed_lst):inversion_number+=ST.Fold(x if weakly else x+1,N)*cST[x]+=creturn inversion_numberdef Compress(lst):decomp=sorted(list(set(lst)))comp={x:i for i,x in enumerate(decomp)}return comp,decompclass Segment_Tree:def __init__(self,N,f,e,lst=None,dynamic=False):self.f=fself.e=eself.N=Nif dynamic:self.segment_tree=defaultdict(lambda:self.e)else:if lst==None:self.segment_tree=[self.e]*2*self.Nelse:assert len(lst)<=self.Nself.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.stepif a==None:a=self.Nelse:a+=self.Nif b==None:b=self.N*2else:b+=self.Nreturn self.segment_tree[slice(a,b,c)]def __setitem__(self,i,x):if -self.N<=i<0:i+=self.N*2elif 0<=i<self.N:i+=self.Nelse:raise IndexError("list index out of range")self.segment_tree[i]=xwhile i>1:i>>= 1self.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]=xfor 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.Nelse:L+=self.Nif R==None:R=self.N*2else:R+=self.NvL=self.evR=self.ewhile L<R:if L&1:vL=self.f(vL,self.segment_tree[L])L+=1if R&1:R-=1vR=self.f(self.segment_tree[R],vR)L>>=1R>>=1return self.f(vL,vR)def Fold_Index(self,L=None,R=None):if L==None:L=self.Nelse:L+=self.Nif R==None:R=self.N*2else:R+=self.Nif L==R:return Nonex=self.Fold(L-self.N,R-self.N)while L<R:if L&1:if self.segment_tree[L]==x:i=LbreakL+=1if R&1:R-=1if self.segment_tree[R]==x:i=RbreakL>>=1R>>=1while i<self.N:if self.segment_tree[i]==self.segment_tree[i<<1]:i<<=1else:i<<=1i|=1i-=self.Nreturn idef Bisect_Right(self,L=None,f=None):if L==self.N:return self.Nif L==None:L=0L+=self.Nvl=self.evr=self.el,r=L,self.N*2while l<r:if l&1:vl=self.f(vl,self.segment_tree[l])l+=1if r&1:r-=1vr=self.f(self.segment_tree[r],vr)l>>=1r>>=1if f(self.f(vl,vr)):return self.Nv=self.ewhile True:while L%2==0:L>>=1vv=self.f(v,self.segment_tree[L])if f(vv):v=vvL+=1else:while L<self.N:L<<=1vv=self.f(v,self.segment_tree[L])if f(vv):v=vvL+=1return L-self.Ndef Bisect_Left(self,R=None,f=None):if R==0:return 0if R==None:R=self.NR+=self.Nvl=self.evr=self.el,r=self.N,Rwhile l<r:if l&1:vl=self.f(vl,self.segment_tree[l])l+=1if r&1:r-=1vr=self.f(self.segment_tree[r],vr)l>>=1r>>=1if f(self.f(vl,vr)):return 0v=self.ewhile True:R-=1while R>1 and R%2:R>>=1vv=self.f(self.segment_tree[R],v)if f(vv):v=vvelse:while R<self.N:R=2*R+1vv=self.f(self.segment_tree[R],v)if f(vv):v=vvR-=1return R+1-self.Ndef __str__(self):return "["+", ".join(map(str,self.segment_tree[self.N:]))+"]"def Swap_Count(N,A,B):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]]retu=Inversion_Number(B)else:retu=-1return retuclass BinaryIndexedTree():def __init__(self, seq):self.size = len(seq)self.depth = self.size.bit_length()self.build(seq)def build(self, seq):data = seqsize = self.sizefor i, x in enumerate(data):j = i + (i & (-i))if j < size:data[j] += data[i]self.data = datadef get_sum(self, i):data = self.datas = 0while i:s += data[i]i -= i & -ireturn sdef add(self, i, x):data = self.datasize = self.sizewhile i < size:data[i] += xi += i & -idef Inversion(seq):N = len(seq)bit = BinaryIndexedTree([0] * (N + 1))inv = N * (N - 1) // 2for x in seq:inv -= bit.get_sum(x)bit.add(x, 1)del bitreturn invN=int(readline())A=[int(readline()) for i in range(N)]comp,decomp=Compress(A)le=len(comp)for i in range(N):A[i]=comp[A[i]]del comp,decompans=Inversion([a+1 for a in A])C=[0]*(le+1)for a in A:C[a+1]+=1for i in range(1,le+1):C[i]+=C[i-1]for a in A:print(ans)ans-=C[a]ans+=(C[le]-C[a+1])