結果
問題 | No.1928 Make a Binary Tree |
ユーザー | harurun |
提出日時 | 2021-12-15 11:59:09 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,734 ms / 3,000 ms |
コード長 | 3,386 bytes |
コンパイル時間 | 160 ms |
コンパイル使用メモリ | 82,228 KB |
実行使用メモリ | 138,224 KB |
最終ジャッジ日時 | 2024-04-23 22:08:41 |
合計ジャッジ時間 | 56,099 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
56,880 KB |
testcase_01 | AC | 42 ms
56,564 KB |
testcase_02 | AC | 41 ms
56,604 KB |
testcase_03 | AC | 42 ms
57,276 KB |
testcase_04 | AC | 41 ms
57,124 KB |
testcase_05 | AC | 42 ms
57,528 KB |
testcase_06 | AC | 44 ms
57,804 KB |
testcase_07 | AC | 43 ms
57,756 KB |
testcase_08 | AC | 50 ms
64,240 KB |
testcase_09 | AC | 50 ms
65,100 KB |
testcase_10 | AC | 44 ms
58,244 KB |
testcase_11 | AC | 43 ms
57,248 KB |
testcase_12 | AC | 43 ms
57,700 KB |
testcase_13 | AC | 43 ms
57,088 KB |
testcase_14 | AC | 44 ms
57,000 KB |
testcase_15 | AC | 278 ms
83,928 KB |
testcase_16 | AC | 237 ms
83,756 KB |
testcase_17 | AC | 210 ms
82,532 KB |
testcase_18 | AC | 278 ms
84,552 KB |
testcase_19 | AC | 125 ms
80,532 KB |
testcase_20 | AC | 237 ms
82,812 KB |
testcase_21 | AC | 171 ms
81,556 KB |
testcase_22 | AC | 226 ms
83,296 KB |
testcase_23 | AC | 212 ms
82,484 KB |
testcase_24 | AC | 253 ms
83,936 KB |
testcase_25 | AC | 273 ms
83,960 KB |
testcase_26 | AC | 1,523 ms
126,616 KB |
testcase_27 | AC | 991 ms
108,028 KB |
testcase_28 | AC | 1,106 ms
111,932 KB |
testcase_29 | AC | 1,650 ms
131,268 KB |
testcase_30 | AC | 901 ms
107,764 KB |
testcase_31 | AC | 1,261 ms
117,456 KB |
testcase_32 | AC | 1,629 ms
129,580 KB |
testcase_33 | AC | 984 ms
108,572 KB |
testcase_34 | AC | 1,191 ms
116,828 KB |
testcase_35 | AC | 1,516 ms
129,712 KB |
testcase_36 | AC | 1,426 ms
138,224 KB |
testcase_37 | AC | 1,161 ms
128,848 KB |
testcase_38 | AC | 41 ms
56,460 KB |
testcase_39 | AC | 1,698 ms
133,260 KB |
testcase_40 | AC | 1,667 ms
133,588 KB |
testcase_41 | AC | 1,726 ms
133,232 KB |
testcase_42 | AC | 1,669 ms
132,456 KB |
testcase_43 | AC | 1,658 ms
132,340 KB |
testcase_44 | AC | 1,692 ms
132,476 KB |
testcase_45 | AC | 1,697 ms
132,768 KB |
testcase_46 | AC | 1,724 ms
132,628 KB |
testcase_47 | AC | 1,734 ms
133,180 KB |
testcase_48 | AC | 1,710 ms
132,448 KB |
testcase_49 | AC | 1,420 ms
128,216 KB |
testcase_50 | AC | 1,647 ms
129,220 KB |
testcase_51 | AC | 1,646 ms
129,080 KB |
testcase_52 | AC | 1,637 ms
129,200 KB |
testcase_53 | AC | 1,654 ms
129,072 KB |
testcase_54 | AC | 1,654 ms
129,056 KB |
testcase_55 | AC | 1,312 ms
127,904 KB |
testcase_56 | AC | 1,654 ms
131,344 KB |
testcase_57 | AC | 1,685 ms
131,744 KB |
testcase_58 | AC | 1,698 ms
131,324 KB |
testcase_59 | AC | 1,039 ms
133,272 KB |
ソースコード
class Stack: def __init__(self,max_size=400010): self._stack=[-1]*max_size self._size=0 return def push(self,x): self._stack[self._size]=x self._size+=1 return def pop(self): self._size-=1 return self._stack[self._size] def empty(self): return self._size==0 class SegTree: def __init__(self,op,e,v): self._op=op self._e=e if isinstance(v,int): v=[e]*v self._n=len(v) self._log=self.ceil2() self._size=1<<self._log self._d=[e]*(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) return def ceil2(self): x=0 while (1<<x)<self._n: x+=1 return x def set(self,p,x): p+=self._size self._d[p]=x for i in range(1,self._log+1): self._update(p>>i) return def get(self,p): return self._d[p+self._size] def prod(self,left,right): sml=self._e smr=self._e left+=self._size right+=self._size while left<right: if left&1: sml=self._op(sml,self._d[left]) left+=1 if right&1: right-=1 smr=self._op(self._d[right],smr) left>>=1 right>>=1 return self._op(sml,smr) def all_prod(self): return self._d[1] def max_right(self,left,target): self.target=target if left==self._n: return self._n left+=self._size sm=self._e first=True while first or (left & -left)!=left: first=False while left%2==0: left>>=1 if not self._f(self._op(sm,self._d[left])): while left<self._size: left*=2 if self._f(self._op(sm,self._d[left])): sm=self._op(sm,self._d[left]) left+=1 return left-self._size sm=self._op(sm,self._d[left]) left+=1 return self._n def min_left(self,right,target): self.target=target if right==0: return 0 right+=self._size sm=self._e first=True while first or (right&-right)!=right: first=False right-=1 while right>1 and right%2: right>>=1 if not self._f(self._op(self._d[right],sm)): while right<self._size: right=2*right+1 if self._f(self._op(self._d[right],sm)): sm=self._op(self._d[right],sm) right-=1 return right+1-self._size sm=self._op(self._d[right],sm) return 0 def _update(self,k): self._d[k]=self._op(self._d[2*k],self._d[2*k+1]) return def _f(self,u): return u<self.target def main(): N=int(input()) Graph=[[]for i in range(N)] for i in range(N-1): x,y=map(int,input().split()) Graph[x-1].append(y-1) Graph[y-1].append(x-1) seg=SegTree(max,[-1,-1],N) st=Stack() st.push(N) st.push(0) checked=[False]*N pre=[0]*N cnt=[1]*N searched=0 while not st.empty(): q=st.pop() if q<N: pre[q]=searched checked[q]=True for to in Graph[q]: if not checked[to]: st.push(to+N) st.push(to) else: for j in range(2): tmp=seg.prod(pre[q-N],searched) if tmp[0]==-1: break cnt[q-N]+=tmp[0] seg.set(tmp[1],[-1,-1]) seg.set(searched,[cnt[q-N],searched]) searched+=1 print(cnt[0]) return main()