結果

問題 No.1790 Subtree Deletion
ユーザー 👑 NachiaNachia
提出日時 2021-12-11 16:18:20
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 953 ms / 3,000 ms
コード長 5,233 bytes
コンパイル時間 240 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 104,500 KB
最終ジャッジ日時 2024-09-15 14:11:01
合計ジャッジ時間 11,230 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
53,376 KB
testcase_01 AC 44 ms
53,376 KB
testcase_02 AC 43 ms
53,376 KB
testcase_03 AC 911 ms
104,328 KB
testcase_04 AC 935 ms
103,856 KB
testcase_05 AC 953 ms
104,088 KB
testcase_06 AC 936 ms
103,560 KB
testcase_07 AC 943 ms
103,120 KB
testcase_08 AC 309 ms
77,184 KB
testcase_09 AC 729 ms
100,352 KB
testcase_10 AC 891 ms
104,500 KB
testcase_11 AC 876 ms
104,248 KB
testcase_12 AC 640 ms
102,668 KB
testcase_13 AC 714 ms
98,968 KB
testcase_14 AC 504 ms
85,936 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# begin
#   ACL for python by shakayami
#   repository : https://github.com/shakayami/ACL-for-python
#   code : https://github.com/shakayami/ACL-for-python/blob/master/lazysegtree.py
class lazy_segtree():
    def update(self,k):self.d[k]=self.op(self.d[2*k],self.d[2*k+1])
    def all_apply(self,k,f):
        self.d[k]=self.mapping(f,self.d[k])
        if (k<self.size):self.lz[k]=self.composition(f,self.lz[k])
    def push(self,k):
        self.all_apply(2*k,self.lz[k])
        self.all_apply(2*k+1,self.lz[k])
        self.lz[k]=self.identity
    def __init__(self,V,OP,E,MAPPING,COMPOSITION,ID):
        self.n=len(V)
        self.log=(self.n-1).bit_length()
        self.size=1<<self.log
        self.d=[E for i in range(2*self.size)]
        self.lz=[ID for i in range(self.size)]
        self.e=E
        self.op=OP
        self.mapping=MAPPING
        self.composition=COMPOSITION
        self.identity=ID
        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.n
        p+=self.size
        for i in range(self.log,0,-1):self.push(p>>i)
        self.d[p]=x
        for i in range(1,self.log+1):self.update(p>>i)
    def get(self,p):
        assert 0<=p and p<self.n
        p+=self.size
        for i in range(self.log,0,-1):self.push(p>>i)
        return self.d[p]
    def prod(self,l,r):
        assert 0<=l and l<=r and r<=self.n
        if l==r:return self.e
        l+=self.size
        r+=self.size
        for i in range(self.log,0,-1):
            if (((l>>i)<<i)!=l):self.push(l>>i)
            if (((r>>i)<<i)!=r):self.push(r>>i)
        sml,smr=self.e,self.e
        while(l<r):
            if l&1:
                sml=self.op(sml,self.d[l])
                l+=1
            if r&1:
                r-=1
                smr=self.op(self.d[r],smr)
            l>>=1
            r>>=1
        return self.op(sml,smr)
    def all_prod(self):return self.d[1]
    def apply_point(self,p,f):
        assert 0<=p and p<self.n
        p+=self.size
        for i in range(self.log,0,-1):self.push(p>>i)
        self.d[p]=self.mapping(f,self.d[p])
        for i in range(1,self.log+1):self.update(p>>i)
    def apply(self,l,r,f):
        assert 0<=l and l<=r and r<=self.n
        if l==r:return
        l+=self.size
        r+=self.size
        for i in range(self.log,0,-1):
            if (((l>>i)<<i)!=l):self.push(l>>i)
            if (((r>>i)<<i)!=r):self.push((r-1)>>i)
        l2,r2=l,r
        while(l<r):
            if (l&1):
                self.all_apply(l,f)
                l+=1
            if (r&1):
                r-=1
                self.all_apply(r,f)
            l>>=1
            r>>=1
        l,r=l2,r2
        for i in range(1,self.log+1):
            if (((l>>i)<<i)!=l):self.update(l>>i)
            if (((r>>i)<<i)!=r):self.update((r-1)>>i)
    def max_right(self,l,g):
        assert 0<=l and l<=self.n
        assert g(self.e)
        if l==self.n:return self.n
        l+=self.size
        for i in range(self.log,0,-1):self.push(l>>i)
        sm=self.e
        while(1):
            while(i%2==0):l>>=1
            if not(g(self.op(sm,self.d[l]))):
                while(l<self.size):
                    self.push(l)
                    l=(2*l)
                    if (g(self.op(sm,self.d[l]))):
                        sm=self.op(sm,self.d[l])
                        l+=1
                return l-self.size
            sm=self.op(sm,self.d[l])
            l+=1
            if (l&-l)==l:break
        return self.n
    def min_left(self,r,g):
        assert (0<=r and r<=self.n)
        assert g(self.e)
        if r==0:return 0
        r+=self.size
        for i in range(self.log,0,-1):self.push((r-1)>>i)
        sm=self.e
        while(1):
            r-=1
            while(r>1 and (r%2)):r>>=1
            if not(g(self.op(self.d[r],sm))):
                while(r<self.size):
                    self.push(r)
                    r=(2*r+1)
                    if g(self.op(self.d[r],sm)):
                        sm=self.op(self.d[r],sm)
                        r-=1
                return r+1-self.size
            sm=self.op(self.d[r],sm)
            if (r&-r)==r:break
        return 0
# end

rq_e = 0
rq_id = -11
def rq_op(a,b) :
  return a ^ b
def rq_mapping(f,x) :
  return x if f == rq_id else f
def rq_conposition(f,x) :
  return x if f == rq_id else f


n = int(input())
e = [[] for i in range(n)]

for i in range(n-1) :
  u,v,a = map(int,input().split())
  u -= 1
  v -= 1
  e[u].append((v,a))
  e[v].append((u,a))

alist = [0] * n
in_time = [0] * n
out_time = [0] * n
dfs_time = 0

def dfs(p, pre) :
  global dfs_time
  in_time[p] = dfs_time
  dfs_time += 1
  for nx,a in e[p] :
    if nx != pre :
      alist[nx] = a
      dfs(nx,p)
  out_time[p] = dfs_time
dfs(0, -1)

a_buf = [0] * n
for i in range(n) : a_buf[in_time[i]] = alist[i]
rq = lazy_segtree(a_buf, rq_op, rq_e, rq_mapping, rq_conposition, rq_id)

q = int(input())
for i in range(q) :
  t,x = map(int,input().split())
  x -= 1
  if t == 1 :
    l = in_time[x]
    r = out_time[x]
    rq.apply(l,r,0)
  elif t == 2 :
    l = in_time[x] + 1
    r = out_time[x]
    res = rq.prod(l,r)
    print(res)
0