Submission #65916265

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import sys
sys.setrecursionlimit(10**6)
n=int(input())
g=[[]for _ in range(n)]
edges=[0]*n
for i in range(1,n):
    u,v=map(int,input().split())
    u-=1
    v-=1
    g[u].append(v)
    g[v].append(u)
    edges[i]=(u,v)
tin=[0]*n
tout=[0]*n
parent=[0]*n
timer=0
def dfs(u,p):
    global timer
    tin[u]=timer
    timer+=1
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import sys
sys.setrecursionlimit(10**6)
n=int(input())
g=[[]for _ in range(n)]
edges=[0]*n
for i in range(1,n):
    u,v=map(int,input().split())
    u-=1
    v-=1
    g[u].append(v)
    g[v].append(u)
    edges[i]=(u,v)

tin=[0]*n
tout=[0]*n
parent=[0]*n
timer=0
def dfs(u,p):
    global timer
    tin[u]=timer
    timer+=1
    parent[u]=p
    for v in g[u]:
        if v==p:continue
        dfs(v,u)
    tout[u]=timer-1
dfs(0,-1)
child=[0]*n
for i in range(1,n):
    u,v=edges[i]
    child[i]=u if parent[u]==v else v

from atcoder.fenwicktree import FenwickTree
ft=FenwickTree(n)
for i in range(n):
    ft.add(tin[i],1)
for _ in range(int(input())):
    q=list(map(int,input().split()))
    if q[0]==1:
        x=q[1]-1
        w=q[2]
        ft.add(tin[x],w)
    else:
        y=q[1]
        v=child[y]
        s=ft.sum(tin[v],tout[v]+1)
        ans=abs(ft.sum(0,n)-2*s)
        print(ans)

Submission Info

Judge Result