#387038 (C++17) No.899 γatheree

• 問題: No.899 γatheree
• ユーザー: Haar
• 提出日時: 2019-10-05 01:27:19
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 1,194 ms / 2,000 ms
• コード長: 6,705 bytes
• コンパイル時間: 3,289 ms
• コンパイル使用メモリ: 212,568 KB
• 最終ジャッジ日時: 2025-01-07 20:58:50
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 1
other	AC * 23

ソースコード

#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;

template <typename Cost = int> class Edge{
public:
  int from,to;
  Cost cost;
  Edge() {}
  Edge(int to, Cost cost): to(to), cost(cost){}
  Edge(int from, int to, Cost cost): from(from), to(to), cost(cost){}

  Edge rev() const {return Edge(to,from,cost);}
  
  friend ostream& operator<<(ostream &os, const Edge &e){
    os << "(FROM: " << e.from << "," << "TO: " << e.to << "," << "COST: " << e.cost << ")";
    return os;
  }
};

template <typename T> using Graph = vector<vector<Edge<T>>>;
template <typename T> using Tree = vector<vector<Edge<T>>>;

template <typename C, typename T> void add_edge(C &g, int from, int to, T w){
  g[from].push_back(Edge<T>(from, to, w));  
}

template <typename C, typename T> void add_undirected(C &g, int a, int b, T w){
  g[a].push_back(Edge<T>(a, b, w));
  g[b].push_back(Edge<T>(b, a, w));
}


template <typename T, typename U> class SegmentTreeRangeUpdateQueryRangeSumQuery{
  int size;
  vector<T> vec1;
  vector<U> vec2;
  vector<bool> is_updated;
  T e1;

  inline void propagate(int i, int l){
    if(is_updated[i]) return;
    if(i < size/2){
      if(not is_updated[i]){
        vec2[i*2+1] = vec2[i];
        vec2[i*2+2] = vec2[i];

        is_updated[i*2+1] = false;
        is_updated[i*2+2] = false;
      }
    }
    if(not is_updated[i]) vec1[i] = vec2[i] * l;
    is_updated[i] = true;
  }

  inline T update_aux(int i, int l, int r, int s, int t, const U &x){
    propagate(i,r-l);
    if(r <= s || t <= l) return vec1[i];
    else if(s <= l && r <= t){
      vec2[i] = x;
      is_updated[i] = false;
      propagate(i,r-l);
      return vec1[i];
    }
    else return vec1[i] = update_aux(i*2+1,l,(l+r)/2,s,t,x) + update_aux(i*2+2,(l+r)/2,r,s,t,x);
  }
  
  inline T query_aux(int i, int l, int r, int x, int y){
    propagate(i,r-l);
    if(r <= x || y <= l) return e1;
    else if(x <= l && r <= y) return vec1[i];
    else return query_aux(i*2+1,l,(l+r)/2,x,y) + query_aux(i*2+2,(l+r)/2,r,x,y);
  }
  
public:
  SegmentTreeRangeUpdateQueryRangeSumQuery(int n, const T &e1, const U &init): e1(e1){
    size = 1;
    while(size<n) size*=2;
    size = size*2-1;

    vec1 = vector<T>(size, init);
    vec2 = vector<U>(size, init);
    is_updated = vector<bool>(size, true);
  }

  inline void update(int s, int t, const U &x){
    update_aux(0,0,size/2+1,s,t,x);
  }
  
  inline T get(int x, int y){
    return query_aux(0,0,size/2+1,x,y);
  }

  inline void update_at(int s, const U &x){
    update(s,s+1,x);
  }

  inline T get_at(int x){
    return get(x,x+1);
  }
};


int bfs_order[101000];
int from[101000], to[101000];

int parent[101000];

void dfs(int cur, int par, Tree<int> &tree){
  parent[cur] = par;

  {
    ITR(it,tree[cur]){
      if(it->to == par){
        tree[cur].erase(it);
        break;
      }
    }
  }

  for(auto &e : tree[cur]){
    if(e.to == par) continue;
    dfs(e.to, cur, tree);
  }
}


void dfs2(int cur, int par, const Tree<int> &tree){

  to[cur] = -1;
  from[cur] = INT_MAX;
  
  for(auto &e : tree[cur]){
    if(e.to == par) continue;
    chmax(to[cur], to[e.to]);
    chmin(from[cur], from[e.to]);
  }

  for(auto &e : tree[cur]){
    if(e.to == par) continue;
    dfs2(e.to, cur, tree);
  }
}


int main(){
  int N; cin >> N;
  Tree<int> tree(N);
  REP(i,N-1){
    int u, v; cin >> u >> v;
    add_undirected(tree, u, v, 1);
  }

  fill_array(bfs_order, -1);

  {
    vector<bool> visited(N);
    queue<int> q;
    q.push(0);

    int i = 0;

    while(q.size()){
      int cur = q.front(); q.pop();

      if(visited[cur]) continue;
      visited[cur] = true;

      bfs_order[cur] = i;
      ++i;

      for(auto &e : tree[cur]){
        if(not visited[e.to]){
          q.push(e.to);
        }
      }
    }
  }
  
  dfs(0, -1, tree);
  

  REP(i,N){
    from[i] = bfs_order[i];
    to[i] = bfs_order[i];
  }
  dfs2(0, -1, tree);
  dfs2(0, -1, tree);

  vector<LLI> A(N); cin >> A;
  SegmentTreeRangeUpdateQueryRangeSumQuery<LLI,LLI> seg(N, 0, 0);
  
  REP(i,N){
    seg.update_at(bfs_order[i], A[i]);
  }

  
  int Q; cin >> Q;
  while(Q--){
    int x; cin >> x;

    LLI ans = 0;
    
    if(parent[x] != -1 and parent[parent[x]] != -1){
      // 親の親
      int i = bfs_order[parent[parent[x]]];
      ans += seg.get_at(i);
      seg.update_at(i, 0);
    }
    
    if(parent[x] != -1){
      {
        // 親
        int i = bfs_order[parent[x]];
        ans += seg.get_at(i);
        seg.update_at(i, 0);
      }
      
      {
        // 親の子
        int i = bfs_order[tree[parent[x]].front().to];
        int j = bfs_order[tree[parent[x]].back().to];

        ans += seg.get(i,j+1);
        seg.update(i,j+1,0);
      }
    }

    // 自分
    ans += seg.get_at(bfs_order[x]);
    seg.update_at(bfs_order[x], 0);
    
    
    if(tree[x].size()){
      // 子
      int i = bfs_order[tree[x].front().to];
      int j = bfs_order[tree[x].back().to];

      ans += seg.get(i,j+1);
      seg.update(i,j+1,0);
    }
    
    if(to[x] != -1){
      // 子の子
      int i = from[x];
      int j = to[x];
      
      ans += seg.get(i,j+1);
      seg.update(i,j+1,0);
    }
    
    seg.update_at(bfs_order[x], ans);
    
    cout << ans << endl;
  }
  
  return 0;
}