LibreOJ NOI Round #2 Day 1

#include<bits/stdc++.h>
#define reg register int
#define il inline
#define fi first
#define se second
#define mk(a,b) make_pair(a,b)
#define numb (ch^'0')
#define pb push_back
#define solid const auto &
#define enter cout<<endl
#define pii pair<int,int>
using namespace std;
typedef long long ll;
template<class T>il void rd(T &x){
    char ch;x=0;bool fl=false;while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);
    for(x=numb;isdigit(ch=getchar());x=x*10+numb);(fl==true)&&(x=-x);}
template<class T>il void output(T x){if(x/10)output(x/10);putchar(x%10+'0');}
template<class T>il void ot(T x){if(x<0) putchar('-'),x=-x;output(x);putchar(' ');}
template<class T>il void prt(T a[],int st,int nd){for(reg i=st;i<=nd;++i) ot(a[i]);putchar('
');}
namespace Modulo{
const int mod=998244353;
il int ad(int x,int y){return x+y>=mod?x+y-mod:x+y;}
il int sub(int x,int y){return ad(x,mod-y);}
il int mul(int x,int y){return (ll)x*y%mod;}
il void inc(int &x,int y){x=ad(x,y);}
il void inc2(int &x,int y){x=mul(x,y);}
il int qm(int x,int y=mod-2){int ret=1;while(y){if(y&1) ret=mul(x,ret);x=mul(x,x);y>>=1;}return ret;}
template<class ...Args>il int ad(const int a,const int b,const Args &...args) {return ad(ad(a,b),args...);}
template<class ...Args>il int mul(const int a,const int b,const Args &...args) {return mul(mul(a,b),args...);}
}
//using namespace Modulo;
namespace Miracle{
const int N=100000+5;
const int inf=0x3f3f3f3f;
int n,m;
ll ans;
priority_queue<ll>q[N][2];
//0: matched miner ; no match gold
//1: matched gold  ; no match miner
struct node{
    int nxt,to;
    int w,c;
}e[2*N];
int du[N];
int hd[N],cnt=1;
void add(int x,int y,int w,int c){
    e[++cnt].nxt=hd[x];
    e[cnt].to=y;e[cnt].w=w;e[cnt].c=c;    
    hd[x]=cnt;
    
    e[++cnt].nxt=hd[y];
    e[cnt].to=x;e[cnt].w=0;e[cnt].c=-c;
    hd[y]=cnt;
}
int pre[N]; 
ll mx;
int id;
void dfs(int x,int fa,ll d,int tp){
    if(!q[x][tp].empty()){
        if(q[x][tp].top()+d>mx){
            mx=q[x][tp].top()+d;
            id=x;
        }
    }
    for(reg i=hd[x];i;i=e[i].nxt){
        int y=e[i].to;
        if(y==fa) continue;
        
        if(tp==0){
            if(e[i].w) pre[y]=i,dfs(y,x,d+e[i].c,tp);
        }else{
            if(e[i^1].w) pre[y]=i,dfs(y,x,d+e[i^1].c,tp);
        }
    }
}
void wrk(int x,int v,int tp){
    mx=1ll*-0x3f3f3f3f3f3f3f3f,id=0;
    dfs(x,0,0,tp);
    
    if(mx+v>0){
        ans+=mx+v;
        ll val=q[id][tp].top();
        q[id][tp].pop();
        q[id][tp^1].push(-val);
        
        q[x][tp].push(-v);
        if(tp==0){
            while(id!=x){
                e[pre[id]].w--;
                e[pre[id]^1].w++;
                id=e[pre[id]^1].to;
            }
        }else{
            while(id!=x){
                e[pre[id]].w++;
                e[pre[id]^1].w--;
                id=e[pre[id]^1].to;
            }
        }
    }else{
        q[x][tp^1].push(v);
    }
}
int main(){
    rd(n);rd(m);
    int x,y,z;
    for(reg i=1;i<n;++i){
        rd(x);rd(y);rd(z);
        add(x,y,inf,z);
        ++du[y];
    }
   // int rt=0;
    //for(reg i=1;i<=n;++i){if(du[i]==0) rt=i;}
    
    int op,v;
    while(m--){
        rd(op);rd(x);rd(v);
        --op;
        wrk(x,v,op);
        printf("%lld
",ans);
    }
    return 0;
}

}
signed main(){
    Miracle::main();
    return 0;
}

/*
   Author: *Miracle*
*/