Codeforces Round #169 (Div. 2):E - Little Girl and Problem on Trees

#include<string>
#include<set>
#include<cmath>
#include<deque>
#include<map>
#include<queue>
#include<cstdio>
#define iinf 1000000000
#define pb push_back
#define mp make_pair
#define lng long long
#define sqr(a) ((a)*(a))
#define pii pair<int,int>
#define X first
#define Y second
#include<cstring>
#include<iostream>
#define N 210000
#define M 20010
#include<algorithm>
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using namespace std;
int Max(int x,int y){if(x<y) return y;return x;}
inline int lowbit(int x){return x&-x;}
struct BIT
{
    vector<int> arr;
    BIT(){arr.push_back(0);}
int sum(int x){int res=0;
     while(x)
     {
         res+=arr[x];
         x-=lowbit(x);
     }
     return res;
}
void update(int x,int p)
{
    if(x>=arr.size()) return ;
    while(x<arr.size())
    {
        arr[x]+=p;
        x+=lowbit(x);
    }
}
void  update(int l,int r,int p)
{
    if(l==0) l=1;
    if(l>=arr.size()||l>r) return ;
    update(l,p);
    update(r+1,-p);
}
}All;
vector<BIT> G;
int ans,n,q,opt,d[N],id[N];
vector<int> a[N];
int now;
void dfs(int r,int f,int dep)
{
    id[r]=now;d[r]=dep;
    if(All.arr.size()<=dep) All.arr.push_back(0);
    G[now].arr.push_back(0);
    for(int i=0;i<a[r].size();++i)
    if(a[r][i]!=f)
    {
        dfs(a[r][i],r,dep+1);
    }
}
int main()
{
    scanf("%d%d",&n,&q);
    for(int i=1;i<n;++i)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        a[u].push_back(v);
        a[v].push_back(u);
    }
    for(int i=0;i<a[1].size();++i)
    {
        now=i;
        G.push_back(BIT());
        dfs(a[1][i],1,1);
    }
    while(q--)
    {
        scanf("%d",&opt);
        if(opt)
        {
            int qu;
            scanf("%d",&qu);
            if(qu==1) printf("%d\n",ans);
            else
            printf("%d\n",All.sum(d[qu])+G[id[qu]].sum(d[qu]));
        }
        else
        {
            int qu,x,dx;
            scanf("%d%d%d",&qu,&x,&dx);
            if(qu==1)
            {
                ans+=x;
                All.update(1,dx,x);
            }
            else
        {
            if(d[qu]>=dx)
            {
            G[id[qu]].update(d[qu]-dx,d[qu]+dx,x);
            if(d[qu]==dx) ans+=x;
            }
            else
            {
                ans+=x;
                G[id[qu]].update(dx-d[qu]+1,d[qu]+dx,x);
                All.update(1,dx-d[qu],x);
            }
        }
        }
    }
    return 0;
}

血淋淋的树状数组