結果

問題 No.1038 TreeAddQuery
ユーザー t9unkubj
提出日時 2024-10-03 06:49:21
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,410 ms / 4,000 ms
コード長 12,262 bytes
コンパイル時間 5,695 ms
コンパイル使用メモリ 301,720 KB
実行使用メモリ 100,568 KB
最終ジャッジ日時 2024-10-03 06:49:50
合計ジャッジ時間 27,570 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifdef t9unkubj
#include"template.h"
//#include"template_no_debug.h"
#else
#undef _GLIBCXX_DEBUG
#pragma GCC optimize("O3")
#define dbg(...) 199958
using namespace std;
#include<bits/stdc++.h>
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T>using vc=vector<T>;
template<class T>using vvc=vc<vc<T>>;
template<class T>using vvvc=vvc<vc<T>>;
using vi=vc<int>;
using vvi=vc<vi>;
using vvvi=vc<vvi>;
using vl=vc<ll>;
using vvl=vc<vl>;
using vvvl=vc<vvl>;
template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>;
template<class T>using bipq=priority_queue<T>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++)
#define DREP(i,n,m) for(ll i=(n);i>=(m);i--)
#define drep(i,n) for(ll i=((n)-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define is insert
#define bg begin()
#define ed end()
void scan(int&a) { cin >> a; }
void scan(ll&a) { cin >> a; }
void scan(string&a) { cin >> a; }
void scan(char&a) { cin >> a; }
void scan(uint&a) { cin >> a; }
void scan(ull&a) { cin >> a; }
void scan(bool&a) { cin >> a; }
void scan(ld&a){ cin>> a;}
template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); }
void read() {}
template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); }
#define INT(...) int __VA_ARGS__; read(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; read(__VA_ARGS__);
#define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__);
#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);
#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__);
#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__);
#define LD(...) ld __VA_ARGS__; read(__VA_ARGS__);
#define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name);
#define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name);
void print(int a) { cout << a; }
void print(ll a) { cout << a; }
void print(string a) { cout << a; }
void print(char a) { cout << a; }
void print(uint a) { cout << a; }
void print(bool a) { cout << a; }
void print(ull a) { cout << a; }
void print(double a) { cout << a; }
void print(ld a){ cout<< a; }
template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;}
void PRT() { cout <<endl; return ; }
template<class T> void PRT(T a) { print(a); cout <<endl; return; }
template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; }
template<class T,class F>
bool chmin(T &x, F y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template<class T, class F>
bool chmax(T &x, F y){
    if(x<y){
        x=y;
        return true;
    }
    return false;
}
void YesNo(bool b){
    cout<<(b?"Yes":"No")<<endl;
}
void Yes(){
    cout<<"Yes"<<endl;
}
void No(){
    cout<<"No"<<endl;
}
template<class T>
int popcount(T n){
    return __builtin_popcountll(n);
}
template<class T>
T sum(vc<T>&a){
    return accumulate(all(a),T(0));
}
template<class T>
T max(vc<T>&a){
    return *max_element(all(a));
}
template<class T>
T min(vc<T>&a){
    return *min_element(all(a));
}
template<class T>
void unique(vc<T>&a){
    a.erase(unique(all(a)),a.end());
}
vvi readgraph(int n,int m,int off = -1){
    vvi g(n);
    rep(i, m){
        int u,v;
        cin>>u>>v;
        u+=off,v+=off;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    return g;
}
vvi readtree(int n,int off=-1){
    return readgraph(n,n-1,off);
}
template<class T>
vc<T> presum(vc<T> &a){
    vc<T> ret(a.size()+1);
    rep(i,a.size())ret[i+1]=ret[i]+a[i];
    return ret;
}
template<class T, class F>
vc<T> &operator+=(vc<T> &a,F b){
    for (auto&v:a)v += b;
    return a;
}
template<class T, class F>
vc<T> &operator-=(vc<T>&a,F b){
    for (auto&v:a)v-=b;
    return a;
}
template<class T, class F>
vc<T> &operator*=(vc<T>&a,F b){
    for (auto&v:a)v*=b;
    return a;
}
#endif
#include<vector>
template <class T = long long >
struct BIT {
    int n;
    std::vector<T>data;
    void add(int i,T x){
        assert(i>=0&&i<n);
        i++;
        for(;i<=n;){
            data[i - 1] += x;
            i += (i & -i);
        }
        return;
    }   
    T internal_sum(int r){
        T ret = 0;
        for(;r;){
            ret += data[r - 1];
            r -= (r & -r);
        }
        return ret;
    }
    T sum(int l,int r){
        return internal_sum(r)-internal_sum(l);
    }
    BIT():n(0), data(0) {}
    BIT(int N):n(N), data(N) {}
    BIT(std::vector<T>& a){
        n = a.size();
        data.assign(n, 0);
        for (int i = 0; i < n; i++)add(i, a[i]);
    }
    int lower_bound(T w) { 
    if (w <= 0) {
        return 0;
    } else {
        int x = 0, r = 1;
        while (r < n) r = r << 1;
        for (int len = r; len > 0; len = len >> 1) { 
            if (x + len < n && data[x + len] < w) {
                w -= data[x + len];
                x += len;
            }
        }
        return x;
    }
}
};
#include<vector>
#include<cassert>
#include<algorithm>
struct HLD{
    int n;
    std::vector<int>depth,head,siz_,par,in,out;
    std::vector<std::vector<int>>g,c;
    HLD(int n):n(n),depth(n),head(n),siz_(n,1),in(n),out(n),g(n),c(n){}
    HLD(int n,std::vector<std::vector<int>>g):n(n),depth(n),head(n),siz_(n,1),in(n),out(n),g(g),c(n){}
    int inited=0;
    void add_edge(int u,int v,bool d=0){
        g[u].emplace_back(v);
        if(d)g[v].emplace_back(u);
    }
    void init_dfs1(int now,int pre){
        for(int &x:g[now]){
            if(x==pre)continue;
            c[now].emplace_back(x);
            depth[x]=depth[now]+1;
            par[x]=now;
            init_dfs1(x,now);
            siz_[now]+=siz_[x];
        }
    }
    void init_dfs2(int now,int pre,int&order){
        in[now]=order++;
        for(int i=0;i<(int)c[now].size();i++){
            if(siz_[c[now][0]]<siz_[c[now][i]])std::swap(c[now][0],c[now][i]);
        }
        for(int x:c[now]){
            if(x==c[now][0])head[x]=head[now];
            else head[x]=x;
            init_dfs2(x,now,order);
        }
        out[now]=order++;
    }
    void init(int root=0){//rootからの有向辺にになることに注意
        par=head=std::vector<int>(n,root);
        int order{};
        init_dfs1(root,-1);
        init_dfs2(root,-1,order);
    }
    int lca(int u,int v){//O(logN) u,vのlcaを取得する
        if(head[u]==head[v])return (depth[u]>depth[v]?v:u);
        if(depth[head[u]]>depth[head[v]])std::swap(u,v);
        v=par[head[v]];
        return lca(u,v);
    }
    int f1(int a){//入った時間を返すO(1)
        return in[a];
    }
    int f2(int a){//出た時間を返すO(1)
        return out[a];
    }
    int dis(int u,int v){//uとvの最短距離を求めるO(logN)
        assert(0<=u&&u<n);
        assert(0<=v&&v<n);
        return depth[u]+depth[v]-2*depth[lca(u,v)];
    }
    template<class T,class G>
    void set(int u,T&seg,G x){
        seg.set(f1(u),x);
    }
    template<class T,class G>
    G prod(int u,int v,bool edge,T&seg){//[u,v]の演算結果を取得する,G>ret T>seg木　O(log^2N)
        G sml=seg.e,smr=seg.e;
        while(1){
            if(in[u]>in[v])swap(u,v),swap(sml,smr);
            if(head[u]==head[v])break;
            smr=seg.op(smr,seg.prod(in[head[v]],in[v]+1));
            v=par[head[v]];
        }
        return seg.op(sml,seg.op(smr,seg.prod(in[u]+edge,in[v]+1)));
    }
    vector<vector<int>>db;
    void la_init(){
        int log=0;
        while((1<<log)<n)log++;
        db.resize(log,vector<int>(n));
        db[0]=par;
        for(int i=1;i<log;i++){
            for(int j=0;j<n;j++){
                int nxt=db[i-1][j];
                if(nxt==-1)db[i][j]=-1;
                else{
                    db[i][j]=db[i-1][nxt];
                }
            }
        }
    }    
    int la(int x,int p){
        int now=0;
        while(p){
            if(p&1)x=db[now][x];
            p>>=1;
            now++;
            if(x==-1)return -1;
        }
        return x;
    }
};
double pass_time=0;
#include<vector>
#include<cassert>
using namespace std;
struct centroid_decomposition{
    vector<int>rem,si;
    vector<vector<int>>g;
    int n;
    centroid_decomposition(int n):n(n),rem(n),si(n),g(n){}
    void add_edge(int a,int b){
        g[a].push_back(b);
        g[b].push_back(a);
    }
    int get_centroid(int v){
        vector<int>ver;
        auto dfs=[&](auto&dfs,int u,int v)->void{
            ver.emplace_back(u);
            si[u]=1;
            for(auto x:g[u]){
                if(rem[x]||x==v)continue;
                dfs(dfs,x,u);
                si[u]+=si[x];
            }
        };dfs(dfs,v,-1);
        int now=(int)1e9;
        int now_idx=-1;
        for(auto x:ver){
            if(si[x]*2>=(int)ver.size()){
                if(now>si[x]){
                    now=si[x];
                    now_idx=x;
                }
            }
        }
        assert(now_idx!=-1);
        return now_idx;
    }
    //重心をつなげた時のやつ
    vi g_par;
    
    //どこの辺から来たか
    vvi edge;
    //offset
    vvl sm;
    vc<BIT<ll>>bit;
    vvc<BIT<ll>>bit2;
    vi d;
    vvi df;
    vvi st;
    vvvi en;
    void init(){
        int log=0;
        while((1<<log)<=n)log++;
        edge.resize(n,vi(log,-1));
        g_par.resize(n,-1);
        df.resize(n,vi(log));
        sm.resize(n);
        bit.resize(n);   
        bit2.resize(n);
        d.resize(n);
    }
    void decomposition(int v,int depth,int pre){
        int t=get_centroid(v);
        assert(!rem[t]);
        if(pre!=-1)g_par[t]=pre;
        rem[t]=1;
        sm[t].resize(g[t].size());
        bit2[t].resize(g[t].size());
        d[t]=depth;
        int mx=0;
        rep(i,g[t].size()){
            int x=g[t][i];
            if(rem[x])continue;
            int f=0;
            auto dfs=[&](auto&dfs,int u,int v,int d)->void{
                chmax(mx,d);
                chmax(f,d);
                edge[u][depth]=i;
                df[u][depth]=d;
                for(auto&x:g[u]){
                    if(x==v||rem[x])continue;
                    dfs(dfs,x,u,d+1);
                }
            };
            dfs(dfs,x,t,1);
            bit2[t][i]=BIT<ll>(f+5);
        }
        bit[t]=BIT<ll>(mx+5);
        for(auto x:g[t]){
            if(!rem[x]){
                decomposition(x,depth+1,t);
            }
        }
        rem[t]=0;
    }    
};
void solve(){
    INT(n,q);
    auto G=readtree(n);
    centroid_decomposition g(n);
    rep(i,n)for(auto&x:G[i])if(i<x)g.add_edge(i,x);
    HLD hld(n,G);
    hld.init(0);
    g.init();
    g.decomposition(0,0,-1);
    dbg(g.g_par);
    while(q--){
        INT(x,y,z);
        --x;
        //get_val
        auto get=[&](int x){
            ll val=0;
            int now=x;
            while(1){
            int de=g.d[now];
            val+=g.bit[now].sum(0,g.df[x][de]+1);
            int e=g.edge[x][de];
            if(x!=now){
                val+=g.bit2[now][e].sum(0,g.df[x][de]+1);
            }
            
            if(g.g_par[now]==-1)break;
            now=g.g_par[now];
            }
            return val;
        };
        PRT(get(x));
        //update
        int now=x;
        while(1){
        dbg(now);
            int dist=y-hld.dis(now,x);
            if(dist>=0){
            //distいかに可算
            g.bit[now].add(0,z);
            g.bit[now].add(min(g.bit[now].n-1,dist+1),-z);
            if(now!=x){
                int e=g.edge[x][g.d[now]];
                g.bit2[now][e].add(0,-z);
                g.bit2[now][e].add(min(g.bit2[now][e].n-1,dist+1),z);
                
            }
            }
            
            if(g.g_par[now]==-1)break;
            now=g.g_par[now];
        }
    }
}
signed main(){
#ifdef t9unkubj
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
    cin.tie(0)->sync_with_stdio(0);
    pass_time=clock();
    int t=1;
    //cin>>t;
    while(t--)solve();
    pass_time=clock()-pass_time;
    dbg(pass_time/CLOCKS_PER_SEC);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0