# Submit Info #3044

Problem Lang User Status Time Memory
Vertex Add Path Sum cpp tute7627 AC 1088 ms 207.85 MiB

ケース詳細
Name Status Time Memory
almost_line_00 AC 1028 ms 196.78 MiB
almost_line_01 AC 1062 ms 190.84 MiB
example_00 AC 6 ms 0.59 MiB
line_00 AC 1073 ms 187.02 MiB
line_01 AC 1088 ms 207.85 MiB
max_random_00 AC 1008 ms 148.48 MiB
max_random_01 AC 1006 ms 148.48 MiB
max_random_02 AC 1024 ms 148.52 MiB
random_00 AC 827 ms 117.79 MiB
random_01 AC 953 ms 138.23 MiB
random_02 AC 230 ms 17.57 MiB
random_03 AC 528 ms 128.73 MiB
random_04 AC 381 ms 86.23 MiB
small_00 AC 7 ms 0.89 MiB
small_01 AC 6 ms 0.63 MiB
small_02 AC 5 ms 0.62 MiB
small_03 AC 6 ms 0.64 MiB
small_04 AC 6 ms 0.76 MiB

#include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define test cout<<"test"<<endl; #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD = 1e9+7; //const ll MOD = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T> void chmin(T &a,T b){if(a>b)a=b;} template<typename T> void chmax(T &a,T b){if(a<b)a=b;} void pmod(ll &a,ll b){a=(a+b)%MOD;} void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;} void qmod(ll &a,ll b){a=(a*b)%MOD;} void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2> void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++) {cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}}; void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++) {for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}}; template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0]; for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;}; template<typename T> vector<vector<T>>vec(ll x, ll y, T w){ vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,0,-1,0,1,1,-1,-1}; vector<ll>dy={0,1,0,-1,1,-1,1,-1}; template<typename T> vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts> auto make_v(size_t a,Ts... ts){ return vector<decltype(make_v(ts...))>(a,make_v(ts...)); } ostream &operator<<(ostream &os, pair<ll, ll>&p){ return os << p.first << " " << p.second; } struct edge{ ll to,cost; edge(ll t,ll c):to(t),cost(c){}; }; struct HLD{ ll n, root; vector<ll>sz;//部分木サイズ vector<ll>depth,par,hv_chi; vector<ll>head; vector<vector<struct edge>>g;//隣接リスト vector<struct edge>edges;//データ構造に乗せるedge列 vector<ll>idx;//edge列のindexを下側の頂点から求めるor頂点列のindex vector<ll>subidx;//部分木に含まれる最後の頂点+1 HLD(vector<vector<struct edge>>G,ll r) :g(G),n(G.size()),root(r){ depth.assign(n,-1),par.assign(n,-1),hv_chi.assign(n,-1); sz.assign(n,-1),head.assign(n,-1),idx.assign(n,-1); subidx.assign(n,-1); edges.emplace_back(0,0); idx[root] = 0; dfs_sz(root,0); dfs_hl(root); subidx[root]=edges.size(); } ll dfs_sz(ll k, ll d){ depth[k] = d; ll sum_sz = 0; ll max_sz = 0,idx = -1; for(ll i=0;i<g[k].size();i++){ if(depth[g[k][i].to] == -1){ ll tmp_sz = dfs_sz(g[k][i].to, d+1); sum_sz += tmp_sz; if(max_sz < tmp_sz)max_sz = tmp_sz,idx = g[k][i].to; par[g[k][i].to] = k; } } hv_chi[k] = idx; sz[k] = sum_sz + 1; return sz[k]; } void dfs_hl(ll k){ if(head[k]==-1)head[k]=k; for(ll i=0;i<g[k].size();i++){ if(head[g[k][i].to]==-1&&hv_chi[k]==g[k][i].to){ head[g[k][i].to] = head[k]; idx[g[k][i].to]=edges.size(); edges.push_back(g[k][i]); dfs_hl(g[k][i].to); subidx[g[k][i].to]=edges.size(); } } for(ll i=0;i<g[k].size();i++){ if(head[g[k][i].to]==-1&&hv_chi[k]!=g[k][i].to){ idx[g[k][i].to]=edges.size(); edges.push_back(g[k][i]); dfs_hl(g[k][i].to); subidx[g[k][i].to]=edges.size(); } } } ll lca(ll p,ll q){ while(1){ if(depth[head[p]] > depth[head[q]])swap(p,q); if(head[p] == head[q])break; q = par[head[q]]; } if(depth[p] > depth[q])swap(p,q); return p; } vector<pair<ll,ll>>query_path(ll p,ll q,bool isEdge){ vector<ll>v = {p,q}; ll r=lca(p,q); vector<pair<ll,ll>>ret; for(ll i=0;i<2;i++){ while(1){ if(isEdge&&v[i]==r)break; if(head[v[i]]==head[r]){ ret.emplace_back(idx[r]+(isEdge?1:i),idx[v[i]]+1); break; } ret.emplace_back(idx[head[v[i]]],idx[v[i]]+1); v[i] = par[head[v[i]]]; } } return ret; } pair<ll,ll>query_subtree(ll p,bool isEdge){ return MP(idx[p]+isEdge,subidx[p]); } }; template<typename T> struct BIT{ ll n; ll k=1; vector<T>data; BIT(ll size):n(size){ data.assign(n,0); while(k*2<=n)k*=2; } void add(ll a,T w){ for(ll i=a+1;i<=n;i+=i&-i)data[i-1]+=w; } T sum(ll a){ T ret = 0; for(ll i=a+1;i>0;i-=i&-i)ret+=data[i-1]; return ret; } T sum(ll a,ll b){return a>b?0:sum(b)-sum(a-1);} T operator[](ll pos){ return sum(pos,pos); } ll lower_bound(ll x){ ll ret=0; for(ll i=k;i>0;i/=2){ if(ret+i<=n&&data[ret+i-1]<x){ x-=data[ret+i-1]; ret+=i; } } return ret; } }; int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n,q;cin>>n>>q; BIT<ll>bit(n); vector<ll>val(n); rep(i,0,n)cin>>val[i]; vector<vector<edge>>g(n); rep(i,0,n-1){ ll u,v;cin>>u>>v; g[u].EB(v,1); g[v].EB(u,1); } HLD hld(g,0); rep(i,0,n){ bit.add(hld.idx[i],val[i]); } while(q--){ ll t;cin>>t; if(t==0){ ll p,x;cin>>p>>x; bit.add(hld.idx[p],x); } else{ ll u,v;cin>>u>>v; ll ret=0; auto ver=hld.query_path(u,v,false); for(auto z:ver){ ret+=bit.sum(z.fi,z.se-1); } cout<<ret<<endl; } } return 0; }