結果
問題 | No.919 You Are A Project Manager |
ユーザー | vwxyz |
提出日時 | 2023-03-26 04:04:19 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 6,728 bytes |
コンパイル時間 | 78 ms |
コンパイル使用メモリ | 13,696 KB |
実行使用メモリ | 61,196 KB |
最終ジャッジ日時 | 2024-09-19 06:48:48 |
合計ジャッジ時間 | 13,485 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | TLE | - |
testcase_01 | AC | 31 ms
11,520 KB |
testcase_02 | AC | 30 ms
11,392 KB |
testcase_03 | AC | 32 ms
11,392 KB |
testcase_04 | AC | 443 ms
21,544 KB |
testcase_05 | AC | 485 ms
22,344 KB |
testcase_06 | AC | 82 ms
12,032 KB |
testcase_07 | TLE | - |
testcase_08 | AC | 582 ms
15,852 KB |
testcase_09 | AC | 370 ms
14,976 KB |
testcase_10 | AC | 796 ms
17,064 KB |
testcase_11 | AC | 750 ms
16,748 KB |
testcase_12 | AC | 34 ms
11,776 KB |
testcase_13 | AC | 970 ms
18,884 KB |
testcase_14 | AC | 51 ms
11,648 KB |
testcase_15 | AC | 225 ms
13,312 KB |
testcase_16 | AC | 1,687 ms
21,224 KB |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | TLE | - |
testcase_20 | TLE | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
testcase_48 | -- | - |
testcase_49 | -- | - |
testcase_50 | -- | - |
testcase_51 | -- | - |
testcase_52 | -- | - |
testcase_53 | -- | - |
testcase_54 | -- | - |
testcase_55 | -- | - |
testcase_56 | -- | - |
testcase_57 | -- | - |
ソースコード
import sys readline=sys.stdin.readline from collections import defaultdict def Compress(lst): decomp=sorted(list(set(lst))) comp={x:i for i,x in enumerate(decomp)} return comp,decomp def Mo(N,Q,query): D=max(1,int(N/Q**.5)) mo=[[] for d in range((N+D-1)//D+1)] for q,(l,r) in enumerate(query): mo[l//D].append(q) retu=[] for d in range((N+D-1)//D+1): retu+=sorted(mo[d],reverse=d%2,key=lambda q:query[q][1]) return retu 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())) query=[] for K in range(1,N+1): for l in range(0,N-K+1,K): query.append((l,l+K)) if N%K: for r in range(N,K-1,-K): query.append((r-K,r)) Q=len(query) L,R=0,0 comp,decomp=Compress(A) le=len(comp) for i in range(N): A[i]=comp[A[i]] ST=Segment_Tree(le,lambda x,y:x+y,0) dct={} for q in Mo(N,Q,query): l,r=query[q] while l<L: L-=1 ST[A[L]]+=1 while R<r: ST[A[R]]+=1 R+=1 while L<l: ST[A[L]]-=1 L+=1 while r<R: R-=1 ST[A[R]]-=1 dct[(l,r)]=decomp[ST.Bisect_Right(0,lambda x:x<=(r-l-1)//2)] inf=1<<60 ans=-inf for K in range(1,N+1): left=[0] for l in range(0,N-K+1,K): left.append(dct[(l,l+K)]) for i in range(1,len(left)): left[i]+=left[i-1] for i in range(1,len(left)): left[i]=max(left[i],left[i-1]) right=[0] for r in range(N,K-1,-K): right.append(dct[(r-K,r)]) for i in range(1,len(right)): right[i]+=right[i-1] for i in range(1,len(left)): right[i]=max(right[i],right[i-1]) for x,y in zip(left,right[::-1]): ans=max(ans,(x+y)*K) print(ans)