結果

問題 No.1038 TreeAddQuery
ユーザー 👑 emthrmemthrm
提出日時 2020-07-30 17:34:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 3,861 ms / 4,000 ms
コード長 5,380 bytes
コンパイル時間 3,101 ms
コンパイル使用メモリ 236,744 KB
実行使用メモリ 279,328 KB
最終ジャッジ日時 2024-07-04 10:20:31
合計ジャッジ時間 51,464 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 20 ms
6,656 KB
testcase_04 AC 21 ms
6,944 KB
testcase_05 AC 21 ms
7,168 KB
testcase_06 AC 16 ms
6,584 KB
testcase_07 AC 21 ms
6,964 KB
testcase_08 AC 2,322 ms
187,908 KB
testcase_09 AC 2,636 ms
202,180 KB
testcase_10 AC 2,648 ms
205,244 KB
testcase_11 AC 2,657 ms
203,448 KB
testcase_12 AC 2,772 ms
208,700 KB
testcase_13 AC 3,861 ms
279,328 KB
testcase_14 AC 3,543 ms
246,672 KB
testcase_15 AC 3,401 ms
239,100 KB
testcase_16 AC 3,306 ms
235,100 KB
testcase_17 AC 3,632 ms
230,772 KB
testcase_18 AC 669 ms
109,916 KB
testcase_19 AC 822 ms
118,476 KB
testcase_20 AC 820 ms
119,540 KB
testcase_21 AC 911 ms
127,484 KB
testcase_22 AC 1,317 ms
147,188 KB
testcase_23 AC 1,473 ms
154,464 KB
testcase_24 AC 2,280 ms
192,256 KB
testcase_25 AC 3,723 ms
279,320 KB
testcase_26 AC 2,203 ms
198,236 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

struct CentroidDecomposition {
  int root;
  vector<vector<int>> comp;
  vector<int> par;

  CentroidDecomposition(const vector<vector<int>> &graph) : graph(graph) {
    int n = graph.size();
    alive.assign(n, true);
    subtree.resize(n);
    comp.resize(n);
    par.assign(n, -1);
    root = build(0);
  }

private:
  const vector<vector<int>> graph;
  vector<bool> alive;
  vector<int> subtree;

  int build(int s) {
    int centroid = search_centroid(-1, s, calc_subtree(-1, s) / 2);
    alive[centroid] = false;
    for (int e : graph[centroid]) {
      if (alive[e]) {
        comp[centroid].emplace_back(build(e));
        par[e] = centroid;
      }
    }
    alive[centroid] = true;
    return centroid;
  }

  int calc_subtree(int par, int ver) {
    subtree[ver] = 1;
    for (int e : graph[ver]) {
      if (e != par && alive[e]) subtree[ver] += calc_subtree(ver, e);
    }
    return subtree[ver];
  }

  int search_centroid(int par, int ver, int half) {
    for (int e : graph[ver]) {
      if (e != par && alive[e]) {
        if (subtree[e] > half) return search_centroid(ver, e, half);
      }
    }
    return ver;
  }
};

template <typename Abelian>
struct BITRangeAdd {
  BITRangeAdd(int n_, const Abelian UNITY = 0) : n(n_), UNITY(UNITY) {
    ++n;
    dat_const.assign(n, UNITY);
    dat_linear.assign(n, UNITY);
  }

  void add(int left, int right, Abelian val) {
    if (right < ++left) return;
    for (int i = left; i < n; i += i & -i) {
      dat_const[i] -= val * (left - 1);
      dat_linear[i] += val;
    }
    for (int i = right + 1; i < n; i += i & -i) {
      dat_const[i] += val * right;
      dat_linear[i] -= val;
    }
  }

  Abelian sum(int idx) {
    Abelian res = UNITY;
    for (int i = idx; i > 0; i -= i & -i) res += dat_linear[i];
    res *= idx;
    for (int i = idx; i > 0; i -= i & -i) res += dat_const[i];
    return res;
  }

  Abelian sum(int left, int right) {
    if (right <= left) return UNITY;
    return sum(right) - sum(left);
  }

  Abelian operator[](const int idx) { return sum(idx, idx + 1); }

  int n;
private:
  const Abelian UNITY;
  vector<Abelian> dat_const, dat_linear;
};

int main() {
  int n, q; cin >> n >> q;
  vector<vector<int>> graph(n);
  REP(_, n - 1) {
    int a, b; cin >> a >> b; --a; --b;
    graph[a].emplace_back(b);
    graph[b].emplace_back(a);
  }
  CentroidDecomposition cd(graph);
  vector<bool> visited(n, false);
  vector<unordered_map<int, int>> mp(n), minus(n);
  vector<vector<int>> resp(n), depth(n, vector<int>{0}), children(n, vector<int>{0});
  vector<BITRangeAdd<ll>> bit, bit2;
  int idx = -1;
  function<void(int)> rec = [&](int root) {
    ++idx;
    visited[root] = true;
    mp[idx][root] = 0;
    resp[root].emplace_back(idx);
    vector<int> que{root};
    for (int dep = 1; !que.empty(); ++dep) {
      vector<int> nx;
      for (int ver : que) {
        for (int e : graph[ver]) {
          if (!visited[e] && mp[idx].count(e) == 0) {
            int sz = mp[idx].size();
            mp[idx][e] = sz;
            resp[e].emplace_back(idx);
            depth[idx].emplace_back(dep);
            nx.emplace_back(e);
          }
        }
      }
      que.swap(nx);
    }
    bit.emplace_back(mp[idx].size());
    minus[root][idx] = -1;
    int sum_dep = 0;
    for (int dst : graph[root]) {
      if (visited[dst]) continue;
      int max_depth = 0;
      function<void(int, int, int)> dfs = [&](int par, int ver, int dep) {
        chmax(max_depth, dep);
        minus[ver][idx] = sum_dep + dep;
        for (int e : graph[ver]) {
          if (!visited[e] && e != par) dfs(ver, e, dep + 1);
        }
      };
      dfs(root, dst, 0);
      sum_dep += max_depth + 1;
      children[idx].emplace_back(sum_dep);
    }
    bit2.emplace_back(sum_dep);
    for (int e : cd.comp[root]) {
      if (!visited[e]) rec(e);
    }
  };
  rec(cd.root);
  while (q--) {
    int x, y, z; cin >> x >> y >> z; --x;
    ll ans = 0;
    for (int idx : resp[x]) {
      ans += bit[idx][mp[idx][x]];
      if (minus[x][idx] != -1) ans -= bit2[idx][minus[x][idx]];
    }
    cout << ans << '\n';
    for (int idx : resp[x]) {
      int ver = mp[idx][x], dist = y - depth[idx][ver];
      if (dist >= 0) {
        bit[idx].add(0, upper_bound(ALL(depth[idx]), dist) - depth[idx].begin(), z);
        if (dist > 0 && minus[x][idx] != -1) {
          auto it = upper_bound(ALL(children[idx]), minus[x][idx]);
          int l = *prev(it), r = *it - 1;
          bit2[idx].add(l, min(l + dist - 1, r) + 1, z);
        }
      }
    }
  }
  return 0;
}
0