POJ 2763 Housewife Wind 树链拋分

// #include
#include
#include
#includestring.h>
#include
#include
#includeusing namespace std;

#define ll long long 
#define pp pairconst ll MAXN=1e5+233;

class Node
{
    public:
        int next,to,cost;
        void init(int a,int b,int c)
        {
            this->next=a;
            this->to=b;
            this->cost=c;
        }
};
Node G[MAXN*3];
int tree[MAXN],child[MAXN],deep[MAXN],number[MAXN],top[MAXN],points[MAXN],father[MAXN];
int size,summ,n,q,s;
void insert(int pos,int key)
{
    while(posMAXN)
    {
        tree[pos]+=key;
        pos+=pos&(-pos);
    }
}
int getSum(int pos)
{
    int ans=0;
    while(pos)
    {
        ans+=tree[pos];
        pos-=pos&(-pos);
    }return ans;
}
void add(int from,int to,int cost)
{
    G[summ].init(points[from],to,cost);
    points[from]=summ++;
}
void dfs_1(int now,int last,int dep)
{
    deep[now]=dep;
    father[now]=last;
    child[now]=1;
    for(int i=points[now];i!=-1;i=G[i].next)
    {
        int tar=G[i].to;
        int cost=G[i].cost;
        if(tar==last)continue;
        dfs_1(tar,now,dep+1);
        child[now]+=child[tar];
    }
}
void dfs(int now,int last,int first,int cc=0)
{
    top[now] = first ? first : now;
    insert(size,cc);
     // cout
    number[now]=size++;
    int maxx,pos,coS;
    maxx=pos=-1;
    for(int i=points[now];i!=-1;i=G[i].next)
    {
        int tar=G[i].to;
        int cost=G[i].cost;
        if(tar==last)continue;
        if(maxxchild[tar])
        {
            maxx=child[tar];
            pos=tar;
            coS=cost;
        }
    }if(pos!=-1)dfs(pos,now,top[now],coS);
    for(int i=points[now];i!=-1;i=G[i].next)
    {
        int tar=G[i].to;
        int cost=G[i].cost;
        if(tar==last||tar==pos)continue;
        
        dfs(tar,now,0,cost);
    }
}
void update(int num,int key)
{
    int a=G[num*2].to;
    int b=G[num*2+1].to;
    if(father[a]==b)
    {
        key=key-(getSum(number[a])-getSum(number[a]-1));
        insert(number[a],key);
    }else
    {
        key=key-(getSum(number[b])-getSum(number[b]-1));
        insert(number[b],key);
    }
}
int query(int from,int to)
{
    int ans=0;
    int t1=top[from];
    int t2=top[to];
     // cout// cout
    while(t1!=t2)
    {
        if(deep[t1]deep[t2])
        {
            swap(t1,t2);
            swap(from,to);
        }
        ans+=getSum(number[from])-getSum(number[t1]-1);
        from=father[t1];
        t1=top[from];
    }
    int star=min(number[from],number[to]);
    int endd=max(number[from],number[to]);
     // cout// cout
    ans+=getSum(endd)-getSum(star);
    return ans;
}
void init()
{
    size=1;summ=0;
    memset(points,-1,sizeof(points));
    for(int i=1;ii)
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        // cin>>a>>b>>c;
        add(a,b,c);
        add(b,a,c);
    }dfs_1(1,0,0);
    dfs(1,0,0);
    for(int i=0;ii)
    {
        int a,b,c;
        // cin>>c;
        scanf("%d",&c);
        if(c)
        {
            // cin>>a>>b;
            scanf("%d%d",&a,&b);
            a--;
            update(a,b);
        }else{
            // cin>>a;
            scanf("%d",&a);
            cout"\n";
            s=a;
        }
    }
}

int main()
{
    // cin.sync_with_stdio(false);
    cin>>n>>q>>s;init();
    
    return 0;
}