#795711 (C++17) No.1038 TreeAddQuery

提出ソース

結果

問題	No.1038 TreeAddQuery
ユーザー	👑 tute7627
提出日時	2022-09-06 09:44:10
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,362 ms / 4,000 ms
コード長	12,732 bytes
コンパイル時間	3,897 ms
コンパイル使用メモリ	259,588 KB
実行使用メモリ	160,640 KB
最終ジャッジ日時	2024-11-21 11:35:40
合計ジャッジ時間	28,843 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	13 ms 6,816 KB
testcase_04	AC	14 ms 6,816 KB
testcase_05	AC	14 ms 6,820 KB
testcase_06	AC	12 ms 6,820 KB
testcase_07	AC	14 ms 6,816 KB
testcase_08	AC	1,031 ms 129,276 KB
testcase_09	AC	1,133 ms 134,052 KB
testcase_10	AC	1,158 ms 135,464 KB
testcase_11	AC	1,126 ms 134,548 KB
testcase_12	AC	1,169 ms 138,324 KB
testcase_13	AC	1,247 ms 148,572 KB
testcase_14	AC	1,362 ms 160,640 KB
testcase_15	AC	1,314 ms 156,300 KB
testcase_16	AC	1,326 ms 155,576 KB
testcase_17	AC	1,251 ms 152,144 KB
testcase_18	AC	871 ms 128,228 KB
testcase_19	AC	894 ms 129,824 KB
testcase_20	AC	866 ms 130,348 KB
testcase_21	AC	842 ms 130,772 KB
testcase_22	AC	838 ms 130,808 KB
testcase_23	AC	846 ms 130,852 KB
testcase_24	AC	938 ms 131,696 KB
testcase_25	AC	1,185 ms 148,584 KB
testcase_26	AC	1,079 ms 139,628 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

//#define _GLIBCXX_DEBUG

#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 UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#define spa << " " <<
#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 = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
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 T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};  
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";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,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-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...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],i)<make_pair(v[j],j);});
  return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],-i)>make_pair(v[j],-j);});
  return ord;
}
template<typename T> vector<T> inv_perm(const vector<T>&ord){
  vector<T>inv(ord.size());
  for(int i=0;i<ord.size();i++)inv[ord[i]] = i;
  return inv;
}
ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}
ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
ll modulo(ll n,ll d){return (n%d+d)%d;};
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}
ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}
ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge():id(-1){};
  edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
  operator int() const { return to; }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T>revgraph(const Graph<T> &g){
  Graph<T>ret(g.size());
  for(int i=0;i<g.size();i++){
    for(auto e:g[i]){
      int to = e.to;
      e.to = i;
      ret[to].push_back(e);
    }
  }
  return ret;
}
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
  Graph<T> ret(n);
  for(int es = 0; es < m; es++){
    int u,v;
    T w=1;
    cin>>u>>v;u-=indexed,v-=indexed;
    if(weighted)cin>>w;
    ret[u].emplace_back(v,w,es);
    if(!directed)ret[v].emplace_back(u,w,es);
  }
  return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
  Graph<T>ret(n);
  for(int i=1;i<n;i++){
    int p;cin>>p;
    p-=indexed;
    ret[p].emplace_back(i);
    if(!directed)ret[i].emplace_back(p);
  }
  return ret;
}

template<typename T>
struct TreeDistanceQuery{
  int n;
	const Graph<T> &g;
	vector<bool> used;//既に重心として選ばれたか
	vector<int> sub;//部分木のサイズ
  bool weighted;
	TreeDistanceQuery(const Graph<T> &g, bool weighted = false):n(g.size()),g(g),weighted(weighted){
		sub.assign(g.size(), 0);
		used.assign(g.size(), false);
    build();
	}
	int search_centroid(int root){
		return dfs_search(root, -1, dfs_sz(root, -1) / 2 );
	}
	int dfs_sz(int k, int par){
		sub[k] = 1;
		for(auto e:g[k]){
			if(e.to == par || used[e.to])continue;
			sub[k] += dfs_sz(e.to, k);
		}
		return sub[k];
	}
	int dfs_search(int k,int par, int mid){
		for(auto e:g[k]){
			if(e.to == par || used[e.to])continue;
			if(sub[e.to] > mid)return dfs_search(e.to, k, mid);
		}
		return k;
	}
  vector<vector<pair<int,int>>>belong;
  //所属position, index 区間系の場合最初だけ無視
  vector<vector<T>>dist;
  //dist[i][j]:=position i, index jの重心からの距離
  vector<vector<T>>border;
  int ass_position = 0;
  void build(){
    belong.resize(n);
    dist.resize(4*n);
    run(0);
    if(!weighted){
      border.resize(4*n);
      for(int i=0;i<4*n;i++){
        if(dist[i].empty())continue;
        border[i].resize(max(dist[i])+2);
        border[i].back() = dist[i].size();
        for(int j=dist[i].size()-1;j>=0;j--){
          border[i][dist[i][j]]=j;
        }
      }
    }
  }
  void run(int v){
    int cent = search_centroid(v);
    used[cent] = true;
    using pi = pair<int, int>;
    priority_queue<pi, vector<pi>, greater<pi>>pq;
    vector<vector<pair<T,int>>>childs;
    for(auto e:g[cent]){
      if(used[e.to])continue;
      run(e.to);
      queue<tuple<T, int, int>>que;
      childs.emplace_back();
      que.emplace(e.cost, e.to, cent);
      while(!que.empty()){
        auto [d, k, par] = que.front();
        childs.back().emplace_back(d, k);
        que.pop();
        for(auto e:g[k]){
          if(e.to == par || used[e.to])continue;
          que.emplace(d + e.cost, e.to, k);
        }
      }
      if(weighted)sort(childs.back().begin(), childs.back().end());
      pq.emplace(childs.back().size(), childs.size() - 1);
    }
    while(pq.size() > 1){
      auto [sz1, idx1] = pq.top();
      pq.pop();
      auto [sz2, idx2] = pq.top();
      pq.pop();
      dist[ass_position].reserve(childs[idx1].size());
      for(auto [d, vi]: childs[idx1]){
        belong[vi].emplace_back(ass_position, dist[ass_position].size());
        dist[ass_position].push_back(d);
      }
      ass_position++;
      dist[ass_position].reserve(childs[idx2].size());
      for(auto [d, vi]: childs[idx2]){
        belong[vi].emplace_back(ass_position, dist[ass_position].size());
        dist[ass_position].push_back(d);
      }
      ass_position++;
      vector<pair<T,int>>tmp;
      merge(childs[idx1].begin(),childs[idx1].end(),childs[idx2].begin(),childs[idx2].end(),back_inserter(tmp));
      childs[idx2] = tmp;
      pq.emplace(tmp.size(), idx2);
    }
    if(pq.empty()){
      pq.emplace(0, 0);
      childs.emplace_back();
    }
    int idx = pq.top().second;
    dist[ass_position].reserve(childs[idx].size() + 1);
    belong[cent].insert(belong[cent].begin(), make_pair(ass_position, dist[ass_position].size()));
    dist[ass_position].push_back(0);
    for(auto [d, vi]: childs[idx]){
      belong[vi].emplace_back(ass_position, dist[ass_position].size());
      dist[ass_position].push_back(d);
    }
    ass_position++;
    belong[cent].emplace_back(ass_position,0);
    dist[ass_position].push_back(0);
    ass_position++;
    used[cent] = false;
  }
  //[l,r)
  vector<tuple<int,int,int>>query(int v,T l,T r){
    vector<tuple<int,int,int>>ret;
    for(int i = 1; i < belong[v].size(); i++){
      auto [pos, idx] = belong[v][i];
      T vd = dist[pos][idx];
      int li, ri;
      if(weighted){
        int li = lower_bound(dist[pos^1].begin(), dist[pos^1].end(), l - vd) - dist[pos^1].begin();
        int ri = lower_bound(dist[pos^1].begin(), dist[pos^1].end(), r - vd) - dist[pos^1].begin();
      }
      else{
        li = border[pos^1][clamp<T>(l - vd, 0, T(border[pos^1].size()) - 1)];
        ri = border[pos^1][clamp<T>(r - vd, 0, T(border[pos^1].size()) - 1)];
      }
      ret.emplace_back(pos^1, li, ri);
    }
    return ret;
  }
};
template<typename T>
struct BIT{
  ll n;
  ll k=1;
  vector<T>data;
  BIT() = default;
  BIT(ll size):n(size){
    n++;
    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;
  }
  //[l,r)
  void add(ll l,ll r,T w){
	if(l>=r)return;
    add(l,w);add(r,-w);
  }
  T sum(ll a){//[0,a)
	  if(a<=0)return 0;
    T ret = 0;
    for(ll i=a;i>0;i-=i&-i)ret+=data[i-1];
    return ret;
  }
  //[a,b)
  T sum(ll a,ll b){return a>=b?0:sum(b)-sum(a);}
  T operator[](ll pos){
    return sum(0,pos+1);
  }
  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;
  }
  void print(){
    for(ll i=0;i<n-1;i++){
      if(i!=0)cout<<" ";
      cout<<(*this)[i];
    }
    cout<<endl;
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  int n,q;cin>>n>>q;
  auto g=readGraph<int>(n,n-1);
  TreeDistanceQuery tq(g);
  vector<BIT<ll>>bit(tq.dist.size());
  rep(i,0,tq.dist.size()){
    if(tq.dist[i].size()>0){
     bit[i]=BIT<ll>(tq.dist[i].size());
    }
  }
  while(q--){
    ll x,y,z;cin>>x>>y>>z;x--;
    ll ret=0;
    for(auto [pos,idx]:tq.belong[x]){
      ret+=bit[pos][idx];
    }
    auto tmp=tq.query(x,0,y+1);
    for(auto [pos,li,ri]:tmp){
      bit[pos].add(li,ri,z);
    }
    cout<<ret<<endl;
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード