結果
問題 | No.2779 Don't make Pair |
ユーザー |
|
提出日時 | 2024-06-07 21:59:59 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 314 ms / 2,000 ms |
コード長 | 3,327 bytes |
コンパイル時間 | 1,510 ms |
コンパイル使用メモリ | 81,920 KB |
実行使用メモリ | 117,248 KB |
最終ジャッジ日時 | 2024-12-26 08:01:08 |
合計ジャッジ時間 | 8,652 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 24 |
ソースコード
class segtree():n=1size=1log=2d=[0]op=Nonee=10**15def __init__(self,V,OP,E):self.n=len(V)self.op=OPself.e=Eself.log=(self.n-1).bit_length()self.size=1<<self.logself.d=[E for i in range(2*self.size)]for i in range(self.n):self.d[self.size+i]=V[i]for i in range(self.size-1,0,-1):self.update(i)def set(self,p,x):assert 0<=p and p<self.np+=self.sizeself.d[p]=xfor i in range(1,self.log+1):self.update(p>>i)def get(self,p):assert 0<=p and p<self.nreturn self.d[p+self.size]def prod(self,l,r):assert 0<=l and l<=r and r<=self.nsml=self.esmr=self.el+=self.sizer+=self.sizewhile(l<r):if (l&1):sml=self.op(sml,self.d[l])l+=1if (r&1):smr=self.op(self.d[r-1],smr)r-=1l>>=1r>>=1return self.op(sml,smr)def all_prod(self):return self.d[1]def max_right(self,l,f):assert 0<=l and l<=self.nassert f(self.e)if l==self.n:return self.nl+=self.sizesm=self.ewhile(1):while(l%2==0):l>>=1if not(f(self.op(sm,self.d[l]))):while(l<self.size):l=2*lif f(self.op(sm,self.d[l])):sm=self.op(sm,self.d[l])l+=1return l-self.sizesm=self.op(sm,self.d[l])l+=1if (l&-l)==l:breakreturn self.ndef min_left(self,r,f):assert 0<=r and r<=self.nassert f(self.e)if r==0:return 0r+=self.sizesm=self.ewhile(1):r-=1while(r>1 and (r%2)):r>>=1if not(f(self.op(self.d[r],sm))):while(r<self.size):r=(2*r+1)if f(self.op(self.d[r],sm)):sm=self.op(self.d[r],sm)r-=1return r+1-self.sizesm=self.op(self.d[r],sm)if (r& -r)==r:breakreturn 0def update(self,k):self.d[k]=self.op(self.d[2*k],self.d[2*k+1])def __str__(self):return str([self.get(i) for i in range(self.n)])from collections import defaultdictN=int(input())A=list(map(int,input().split()))set_=set()for elm in A: set_.add(elm)zaatsu = dict()ind = 0for elm in set_:zaatsu[elm] = indind+=1left_init = [0]*indleft_init[zaatsu[A[0]]] += 1right_init = [0]*indfor i in range(1, len(A)):right_init[zaatsu[A[i]]] += 1def op(left, right): return max(left, right)e=0left_seg = segtree(left_init, op, e)right_seg = segtree(right_init, op, e)ind = 1ans = []for i in range(N-1):if left_seg.all_prod()<=1 and right_seg.all_prod()<=1: ans.append(ind)bef = left_seg.get(zaatsu[A[ind]])left_seg.set(zaatsu[A[ind]], bef + 1)bef = right_seg.get(zaatsu[A[ind]])right_seg.set(zaatsu[A[ind]], bef - 1)ind += 1print(len(ans))print(*ans)