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

• 問題: No.1038 TreeAddQuery
• ユーザー: cureskol
• 提出日時: 2022-12-20 13:14:25
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 2,444 ms / 4,000 ms
• コード長: 12,974 bytes
• コンパイル時間: 4,190 ms
• コンパイル使用メモリ: 252,536 KB
• 実行使用メモリ: 27,248 KB
• 最終ジャッジ日時: 2024-11-18 01:48:35
• 合計ジャッジ時間: 31,389 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,820 KB
testcase_01	AC	3 ms; 6,816 KB
testcase_02	AC	2 ms; 6,816 KB
testcase_03	AC	13 ms; 6,816 KB
testcase_04	AC	16 ms; 6,820 KB
testcase_05	AC	13 ms; 6,816 KB
testcase_06	AC	13 ms; 6,816 KB
testcase_07	AC	19 ms; 6,820 KB
testcase_08	AC	1,145 ms; 22,904 KB
testcase_09	AC	1,367 ms; 23,028 KB
testcase_10	AC	1,404 ms; 22,988 KB
testcase_11	AC	1,414 ms; 23,032 KB
testcase_12	AC	1,473 ms; 23,040 KB
testcase_13	AC	2,444 ms; 27,248 KB
testcase_14	AC	2,073 ms; 24,176 KB
testcase_15	AC	1,966 ms; 23,672 KB
testcase_16	AC	1,894 ms; 23,548 KB
testcase_17	AC	1,849 ms; 23,276 KB
testcase_18	AC	245 ms; 23,028 KB
testcase_19	AC	331 ms; 23,168 KB
testcase_20	AC	347 ms; 23,048 KB
testcase_21	AC	432 ms; 23,032 KB
testcase_22	AC	624 ms; 23,028 KB
testcase_23	AC	714 ms; 23,164 KB
testcase_24	AC	1,135 ms; 23,168 KB
testcase_25	AC	2,298 ms; 27,120 KB
testcase_26	AC	1,459 ms; 25,216 KB

ソースコード

#pragma region template
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
 
using ll=long long;
using ld=long double;
using vi=vector<int>;
using vll=vector<ll>;
using pi=pair<int,int>;
using pll=pair<ll,ll>;
 
#define overload2(a,b,c,...) c
#define overload3(a,b,c,d,...) d
#define overload4(a,b,c,d,e,...) e
#define overload5(a,b,c,d,e,f,...) f
 
#define TYPE1(T) template<typename T>
#define TYPE2(T,U) template<typename T,typename U>
#define TYPE(...) overload2(__VA_ARGS__,TYPE2,TYPE1)(__VA_ARGS__)
#define TYPES1(T) template<typename... T>
#define TYPES2(H,T) template<typename H,typename... T>
#define TYPES(...) overload2(__VA_ARGS__,TYPES2,TYPES1)(__VA_ARGS__)
 
#define REP4(i,s,n,d) for(int i=(s);i<(n);i+=(d))
#define REP3(i,s,n) REP4(i,s,n,1)
#define REP2(i,n) REP3(i,0,n)
#define REP1(n) REP2(tomato,n)
#define REP(...) overload4(__VA_ARGS__,REP4,REP3,REP2,REP1)(__VA_ARGS__)
 
#define RREP4(i,n,s,d) for(int i=(n)-1;i>=s;i-=d)
#define RREP3(i,n,s) RREP4(i,n,s,1)
#define RREP2(i,n) RREP3(i,n,0)
#define RREP1(n) RREP2(tomato,n)
#define RREP(...) overload4(__VA_ARGS__,RREP4,RREP3,RREP2,RREP1)(__VA_ARGS__)

#define FOR4(a,b,c,d,v) for(auto [a,b,c,d]:v)
#define FOR3(a,b,c,v) for(auto [a,b,c]:v)
#define FOR2(a,b,v) for(auto [a,b]:v)
#define FOR1(a,v) for(auto a:v)
#define FOR(...) overload5(__VA_ARGS__,FOR4,FOR3,FOR2,FOR1)(__VA_ARGS__)

#define AFOR4(a,b,c,d,v) for(auto&[a,b,c,d]:v)
#define AFOR3(a,b,c,v) for(auto&[a,b,c]:v)
#define AFOR2(a,b,v) for(auto&[a,b]:v)
#define AFOR1(a,v) for(auto&a:v)
#define AFOR(...) overload5(__VA_ARGS__,AFOR4,AFOR3,AFOR2,AFOR1)(__VA_ARGS__)

#define CFOR4(a,b,c,d,v) for(const auto&[a,b,c,d]:v)
#define CFOR3(a,b,c,v) for(const auto&[a,b,c]:v)
#define CFOR2(a,b,v) for(const auto&[a,b]:v)
#define CFOR1(a,v) for(const auto&a:v)
#define CFOR(...) overload5(__VA_ARGS__,CFOR4,CFOR3,CFOR2,CFOR1)(__VA_ARGS__)
 
#define ALL(v) v.begin(),v.end()
#define RALL(v) v.rbegin(),v.rend()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define REVERSE(v) reverse(ALL(v))
#define UNIQUE(v) SORT(v),v.erase(unique(ALL(v)),v.end())
 
TYPES(T) void input(T&... a){ (cin>>...>>a); }
#define DECLARE(T,...) T __VA_ARGS__;input(__VA_ARGS__);
#define INT(...) DECLARE(int,__VA_ARGS__)
#define STR(...) DECLARE(string,__VA_ARGS__)
#define LL(...) DECLARE(long long,__VA_ARGS__)
#define CHR(...) DECLARE(char,__VA_ARGS__)
#define DBL(...) DECLARE(double,__VA_ARGS__)
#define VI(n,v) vi v(n);cin>>v;
#define VLL(n,v) vll v(n);cin>>v;
 
TYPE(T) istream&operator>>(istream&is,vector<T>&v){
  for(auto&a:v)cin>>a;
  return is;
}
TYPE(T) ostream&operator<<(ostream&os,const vector<T>&v){
  if(&os==&cerr)os<<"[";
  REP(i,v.size()){
    os<<v[i];
    if(i+1<v.size())os<<(&os==&cerr?",":" ");
  }
  if(&os==&cerr)os<<"]";
  return os;
}
TYPE(T,S) istream&operator>>(istream&is,pair<T,S>&p){
  cin>>p.first>>p.second;
  return is;
}

#ifdef __LOCAL
 #include <debug>
#else
 #define debug(...) void(0)
#endif

void print(){ cout << '\n'; }
TYPES(T,Ts) void print(const T& a,const Ts&... b){
  cout<<a;
  (cout<<...<<(cout<< ' ',b));
  cout << '\n';
}
 
TYPE(T) using pq=priority_queue<T>;
TYPE(T) using pqg=priority_queue<T,vector<T>,greater<T>>;
TYPE(T) T pick(queue<T>& que){assert(que.size()); T a=que.front();que.pop();return a;}
TYPE(T) T pick(pq<T>& que){assert(que.size()); T a=que.top();que.pop();return a;}
TYPE(T) T pick(pqg<T>& que){assert(que.size()); T a=que.top();que.pop();return a;}
TYPE(T) T pick(stack<T>& sta){assert(sta.size()); T a=sta.top();sta.pop();return a;}
 
string YES(bool f=true){return (f?"YES":"NO");}
string Yes(bool f=true){return (f?"Yes":"No");}
string yes(bool f=true){return (f?"yes":"no");}
 
constexpr int INF=1e9+7;
constexpr ll LINF=ll(1e18)+7;
constexpr ld EPS=1e-10;
 
vi iota(int n){vi a(n);iota(ALL(a),0);return a;}
TYPE(T) vector<pair<T,int>> query_sort(const vector<T>&v){
  vector<pair<T,int>> res(v.size());
  REP(i,v.size())res[i]={v[i],i};
  SORT(res);
  return res;
}
TYPE(T) T rev(T a){ REVERSE(a);return a; }
TYPE(T) void fin(T a){cout<<a<<endl;exit(0);}
TYPE(T) bool chmax(T &a,T b){return (a<b&&(a=b,true));}
TYPE(T) bool chmin(T &a,T b){return (a>b&&(a=b,true));}
TYPES(T,Ns) auto make_vector(T x,int n,Ns ...ns){
  if constexpr(sizeof...(ns)==0)return vector<T>(n,x);
  else return vector(n,make_vector<T>(x,ns...));
}
bool in(const ll S,const int a){return (S>>a)&1;}
int popcount(const ll S){return __builtin_popcountll(S);}
int digit(char c){ return (c>='0' and c<='9' ? c-'0' : -1);}
#pragma endregion template

struct Edge{
  int from,to;
  Edge()=default;
  Edge(int from,int to):from(from),to(to){}
};

struct Graph{
  int n;
  using edge_type=Edge;
  vector<edge_type> edges;
protected:
  vector<int> in_deg;
  bool prepared;
 class OutgoingEdges{
    Graph* g;
    int l,r;
  public:
    OutgoingEdges(Graph* g,int l,int r):g(g),l(l),r(r){}
    edge_type* begin(){ return &(g->edges[l]); }
    edge_type* end(){ return &(g->edges[r]); }
    edge_type& operator[](int i){ return g->edges[l+i]; }
    int size()const{ return r-l; }
  };
public:
  OutgoingEdges operator[](int v){
    assert(prepared);
    return { this,in_deg[v],in_deg[v+1] };
  }

  bool is_prepared()const{ return prepared; }

  Graph():n(0),in_deg(1,0),prepared(false){}
  Graph(int n):n(n),in_deg(n+1,0),prepared(false){}
  Graph(int n,int m,bool directed=false,int indexed=1):
    n(n),in_deg(n+1,0),prepared(false){ scan(m,directed,indexed); }

  void resize(int n){n=n;}

  void add_arc(int from,int to){
    assert(!prepared);
    assert(0<=from and from<n and 0<=to and to<n);
    edges.emplace_back(from,to);
    in_deg[from+1]++;
  }
  void add_edge(int u,int v){
    add_arc(u,v);
    add_arc(v,u);
  }
  void add_arc(const edge_type&e){
    add_arc(e.from,e.to);
  }
  void add_edge(const edge_type&e){
    add_edge(e.from,e.to);
  }

  void scan(int m,bool directed=false,int indexed=1){
    edges.reserve(directed?m:2*m);
    while(m--){
      int u,v;cin>>u>>v;u-=indexed;v-=indexed;
      if(directed)add_arc(u,v);
      else add_edge(u,v);
    }
    build();
  }

  void build(){
    assert(!prepared);prepared=true;
    for(int v=0;v<n;v++)in_deg[v+1]+=in_deg[v];
    vector<edge_type> new_edges(in_deg.back());
    auto counter=in_deg;
    for(auto&&e:edges)new_edges[ counter[e.from]++ ]=e;
    edges=new_edges;
  }

  void graph_debug()const{
  #ifndef __LOCAL
    return;
  #endif
    assert(prepared);
    for(int from=0;from<n;from++){
      cerr<<from<<";";
      for(int i=in_deg[from];i<in_deg[from+1];i++)
        cerr<<edges[i].to<<" ";
      cerr<<"\n";
    }
  }
};
struct Tree:Graph{
  using Graph::Graph;
  int root=-1;
  vector<int> DFS,BFS,depth;

  void scan_root(int indexed=1){
    for(int i=1;i<n;i++){
      int p;cin>>p;
      add_edge(p-indexed,i);
    }
    build();
  }
  void scan(int indexed=1){
    Graph::scan(n-1,false,indexed);
    build();
  }

  edge_type& parent(int v){
    assert(~root and root!=v);
    return (*this)[v][0];
  }
  OutgoingEdges son(int v){
    assert(~root);
    if(v==root)return {this,in_deg[v],in_deg[v+1]};
    return {this,in_deg[v]+1,in_deg[v+1]};
  }

private:
  void dfs(int v,int pre=-1){
    for(auto&e:(*this)[v]){
      if(e.to==pre)swap((*this)[v][0],e);
      else{
        depth[e.to]=depth[v]+1;
        dfs(e.to,v);
      }
    }
    DFS.push_back(v);
  }
public:
  void build(int r=0){
    if(!is_prepared())Graph::build();
    if(~root){
      assert(r==root);
      return;
    }
    root=r;
    depth=vector<int>(n,0);
    DFS.reserve(n);BFS.reserve(n);
    dfs(root);
    queue<int> que;
    que.push(root);
    while(que.size()){
      int p=que.front();que.pop();
      BFS.push_back(p);
      for(const auto&e:son(p))que.push(e.to);
    }
  }
};
template<typename TREE>
class CentroidDecomposition{
  TREE T;
  vector<int> sz,pre,timing;

  int find_centroid(int v){
    vector<int> S{v};
    pre[v]=-1;
    for(int i=0;i<S.size();i++){
      const int u=S[i];
      sz[u]=1;
      for(const auto&e:T[u]){
        if(e.to==pre[u]||~timing[e.to])continue;
        pre[e.to]=u;
        S.push_back(e.to);
      }
    }
    int SZ=S.size();
    reverse(S.begin(),S.end());
    for(int u:S){
      if( SZ-sz[u] <= SZ/2 )return u;
      sz[pre[u]] += sz[u];
    }
    assert(false);
    return -1;
  };
public:
  vector<int> order;
  CentroidDecomposition(TREE T):T(T),sz(T.n),pre(T.n),timing(T.n,-1){
    order.reserve(T.n);
    queue<int> que;
    que.push(0);
    while(que.size()){
      int c=find_centroid(que.front());que.pop();
      timing[c]=order.size();
      order.push_back(c);
      for(const auto&e:T[c])
        if(timing[e.to]<0)
          que.push(e.to);
    }
  }

  template<typename X,typename F,typename G,typename H>
  void calc(int root,X initial_val,const F&next_val,const G&action,const H&finish){
    queue<tuple<int,int,X>> que;

    auto f=[&](int v_,int pre_,X val_,bool is_all){
      que.emplace(v_,pre_,val_);
      while(que.size()){
        auto [v,pre,val]=que.front();que.pop();
        action(val,is_all);
        for(const auto&e:T[v]){
          if(e.to==pre||timing[e.to]<=timing[root])continue;
          que.emplace(e.to,v,next_val(val,e));
        }
      }
      finish(is_all);
    };

    for(const auto&e:T[root])
      if(timing[e.to]>timing[root])
        f(e.to,root,next_val(initial_val,e),false);
    
    f(root,-1,initial_val,true);
  }

  template<typename X,typename F,typename G,typename H>
  void all_calc(X initial_val,const F&next_val,const G&action,const H&finish){
    for(int i=0;i<T.n;i++)calc(i,initial_val,next_val,action,finish);
  }
};
template<typename Lazy>
class DualSegmentTree{
  using MX = typename Lazy::MX;
  using MF = typename Lazy::MF;
  using X = typename MX::value_type;
  using F = typename MF::value_type;
  int n,log,size;
  vector<X> dat;
  vector<F> laz;

  void point_apply(int k,const F&f){
    if(k<size)MF::Lchop(f,laz[k]);
    else dat[k-size]=Lazy::mapping(f,dat[k-size]);
  }
  void push(int k){
    point_apply(2*k,laz[k]);
    point_apply(2*k+1,laz[k]);
    laz[k]=MF::unit();
  }
  void thrust(int k){ for(int i=log;i;i--)push(k>>i); }

public:
  DualSegmentTree() : DualSegmentTree(0) {}
  DualSegmentTree(int n):DualSegmentTree(vector<X>(n,MX::unit())) {}
  DualSegmentTree(const vector<X>&v) : n(v.size()),dat(v) {
    for(log=1;(1<<log)<n;log++){}
    size=1<<log;
    laz.assign(size,MF::unit());
  }

  void set(int p,X x){
    assert(0<=p and p<n);
    thrust(p+size);
    dat[p]=x;
  }

  X operator[](int p){
    assert(0<=p and p<n);
    thrust(p+size);
    return dat[p];
  }

  void apply(int l,int r,F f){
    assert(0 <= l && l <= r && r <= n);
    if(l==r)return;
    thrust(l+=size);
    thrust(r+=size-1);
    for(int L=l,R=r+1;L<R;L>>=1,R>>=1){
      if(L&1)point_apply(L++,f);
      if(R&1)point_apply(--R,f);
    }
  }
};
template<typename X>
struct GroupAdd {
  using value_type = X;
  static constexpr X op(const X &x, const X &y) noexcept { return x + y; }
  static constexpr void Rchop(X&x, const X&y){ x+=y; }
  static constexpr void Lchop(const X&x, X&y){ y+=x; }
  static constexpr X inverse(const X &x) noexcept { return -x; }
  static constexpr X power(const X &x, long long n) noexcept { return X(n) * x; }
  static constexpr X unit() { return X(0); }
  static constexpr bool commute = true;
};
template<typename X>
struct MonoidMin{
  using value_type = X;
  static constexpr X op(const X &x, const X &y) noexcept { return min(x,y); }
  static constexpr void Rchop(X&x, const X&y){ if(x>y)x=y; }
  static constexpr void Lchop(const X&x, X&y){ if(y>x)y=x; }
  static constexpr X unit() { return numeric_limits<X>::max()/2; }
  static constexpr bool commute = true;
};
template<typename X>
struct LazyAddMin{
  using MX=MonoidMin<X>;
  using MF=GroupAdd<X>;
  static constexpr X mapping(const X&f,const X&x){
    return f+x;
  }
};

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  INT(n,q);
  Tree T(n);
  T.scan(1);

  DualSegmentTree< LazyAddMin<ll> > seg(vector<ll>(n,0));

  vector<tuple<int,int,int>> query(q);
  vector<vector<int>> query_at(n);
  REP(i,q){
    auto&[x,y,z]=query[i];
    cin>>x>>y>>z;
    x--;
    query_at[x].push_back(i);
  }

  vector<ll> ans(q,0);

  CentroidDecomposition CD(T);
  
  vector<int> D(n),events;
  int root;

  auto next_val=[&](int d,const auto&e){
    FOR(id,query_at[e.to])events.push_back(id);
    return D[e.to]=d+1;
  };
  auto action=[&](int d,bool add){
    if(d==0)next_val(-1,Edge{root,root});
  };
  auto finish=[&](bool add){
    SORT(events);
    CFOR(id,events){
      const auto&[x,y,z]=query[id];
      int d=D[x];
      if(add)ans[id]+=seg[d];
      else ans[id]-=seg[d];
      if(d<=y)
        seg.apply(0,y-d+1,z);
    }
    CFOR(id,events){
      const auto&[x,y,z]=query[id];
      int d=D[x];
      if(d<=y)
        seg.apply(0,y-d+1,-z);
    }
    events.resize(0);
  };

  for(root=0;root<n;root++)
    CD.calc(root,0,next_val,action,finish);
  
  FOR(p,ans)cout<<p<<"\n";
}