test/verify/aoj-2667.test.cpp

View this file on GitHub
Last update: 2026-08-10 15:36:17+00:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2667

Depends on

Code

// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2667
// clang-format on

#include <cstdint>
#include <functional>
#include <iostream>
#include <vector>

#include "../../graph/tree/heavy-light-decomposition.hpp"

using namespace std;

int main() {
  int N, Q;
  cin >> N >> Q;
  HeavyLightDecomposition<> hld(N);
  hld.read(N - 1, 0);
  hld.build();

  struct Query {
    int t, a, b;

    void input() { cin >> t >> a >> b; }
  };

  vector<int> remark;
  vector<Query> qs;
  vector<int64_t> sum(N);

  vector<int> index(N);
  for (int i = 0; i < Q; i++) {
    Query q;
    q.input();
    qs.emplace_back(q);
    if (q.t == 0) {
      remark.emplace_back(q.a);
      remark.emplace_back(q.b);
    } else {
      remark.emplace_back(q.a);
    }
    if (remark.size() >= 2000 || i + 1 == Q) {
      auto es = hld.compress(remark);
      for (int j = 0; j < remark.size(); j++) index[remark[j]] = j;
      vector<int> dist(remark.size()), par(remark.size());
      Graph<> h(remark.size());
      for (auto& p : es) {
        p.first = index[p.first];
        p.second = index[p.second];
        par[p.second] = p.first;
        dist[p.second] = hld.dist(remark[p.first], remark[p.second]);
        h.add_directed_edge(p.first, p.second);
      }
      vector<int64_t> lazy_add(N), backet_add(N);
      for (auto& q : qs) {
        if (q.t == 0) {
          int64_t ret = 0;
          ret += sum[q.a] + sum[q.b] - 2 * sum[hld.lca(q.a, q.b)];
          ret += backet_add[q.a] + backet_add[q.b] -
                 2 * backet_add[hld.lca(q.a, q.b)];
          cout << ret << "\n";
        } else {
          lazy_add[q.a] += q.b;
          q.a = index[q.a];
          function<void(int, int, int64_t)> dfs = [&](int idx, int p,
                                                      int64_t sz) {
            for (auto& to : h.g[idx]) {
              if (to != p) {
                backet_add[remark[to]] += (sz + dist[to]) * q.b;
                dfs(to, idx, sz + dist[to]);
              }
            }
          };
          dfs(q.a, par[q.a], 0);
        }
      }
      function<void(int, int, int64_t, int64_t)> dfs =
          [&](int idx, int par, int64_t add, int64_t all) {
            all += add;
            add += lazy_add[idx];
            sum[idx] += all;
            for (auto& to : hld.g[idx]) {
              if (to != par) dfs(to, idx, add, all);
            }
          };
      dfs(0, -1, 0, 0);
      qs.clear();
      remark.clear();
    }
  }
}

#line 1 "test/verify/aoj-2667.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2667
// clang-format on

#include <cstdint>
#include <functional>
#include <iostream>
#include <vector>

#line 2 "graph/tree/heavy-light-decomposition.hpp"

#include <algorithm>
#include <stack>
#include <utility>
#line 7 "graph/tree/heavy-light-decomposition.hpp"

#line 2 "graph/graph-template.hpp"

#include <cstddef>
#line 6 "graph/graph-template.hpp"

template <typename T = int>
struct Edge {
  int from, to;
  T cost;
  int idx;

  Edge() = default;

  Edge(int from, int to, T cost = 1, int idx = -1)
      : from(from), to(to), cost(cost), idx(idx) {}

  operator int() const { return to; }
};

template <typename T = int>
struct Graph {
  std::vector<std::vector<Edge<T> > > g;
  int es;

  Graph() = default;

  explicit Graph(int n) : g(n), es(0) {}

  std::size_t size() const { return g.size(); }

  void add_directed_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es++);
  }

  void add_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es);
    g[to].emplace_back(to, from, cost, es++);
  }

  void read(int M, int padding = -1, bool weighted = false,
            bool directed = false) {
    for (int i = 0; i < M; i++) {
      int a, b;
      std::cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if (weighted) std::cin >> c;
      if (directed)
        add_directed_edge(a, b, c);
      else
        add_edge(a, b, c);
    }
  }

  inline std::vector<Edge<T> >& operator[](const int& k) { return g[k]; }

  inline const std::vector<Edge<T> >& operator[](const int& k) const {
    return g[k];
  }
};

template <typename T = int>
using Edges = std::vector<Edge<T> >;
#line 9 "graph/tree/heavy-light-decomposition.hpp"

/**
 * @brief Heavy-Light-Decomposition(HL分解)
 * @see https://smijake3.hatenablog.com/entry/2019/09/15/200200
 */
template <typename T = int>
struct HeavyLightDecomposition : Graph<T> {
 public:
  using Graph<T>::Graph;
  using Graph<T>::g;
  std::vector<int> sz, in, out, head, rev, par, dep;

  void build(int root = 0) {
    sz.assign(g.size(), 0);
    in.assign(g.size(), 0);
    out.assign(g.size(), 0);
    head.assign(g.size(), 0);
    rev.assign(g.size(), 0);
    par.assign(g.size(), 0);
    dep.assign(g.size(), 0);
    dfs_sz(root, -1, 0);
    int t = 0;
    head[root] = root;
    dfs_hld(root, -1, t);
  }

  /* k: 0-indexed */
  int la(int v, int k) {
    while (1) {
      int u = head[v];
      if (in[v] - k >= in[u]) return rev[in[v] - k];
      k -= in[v] - in[u] + 1;
      v = par[u];
    }
  }

  int lca(int u, int v) const {
    for (;; v = par[head[v]]) {
      if (in[u] > in[v]) std::swap(u, v);
      if (head[u] == head[v]) return u;
    }
  }

  int dist(int u, int v) const { return dep[u] + dep[v] - 2 * dep[lca(u, v)]; }

  template <typename E, typename Q, typename F, typename S>
  E query(int u, int v, const E& ti, const Q& q, const F& f, const S& s,
          bool edge = false) {
    E l = ti, r = ti;
    for (;; v = par[head[v]]) {
      if (in[u] > in[v]) std::swap(u, v), std::swap(l, r);
      if (head[u] == head[v]) break;
      l = f(q(in[head[v]], in[v] + 1), l);
    }
    return s(f(q(in[u] + edge, in[v] + 1), l), r);
  }

  template <typename E, typename Q, typename F>
  E query(int u, int v, const E& ti, const Q& q, const F& f,
          bool edge = false) {
    return query(u, v, ti, q, f, f, edge);
  }

  template <typename Q>
  void add(int u, int v, const Q& q, bool edge = false) {
    for (;; v = par[head[v]]) {
      if (in[u] > in[v]) std::swap(u, v);
      if (head[u] == head[v]) break;
      q(in[head[v]], in[v] + 1);
    }
    q(in[u] + edge, in[v] + 1);
  }

  /* {parent, child} */
  std::vector<std::pair<int, int> > compress(std::vector<int>& remark) {
    auto cmp = [&](int a, int b) { return in[a] < in[b]; };
    std::sort(std::begin(remark), std::end(remark), cmp);
    remark.erase(std::unique(std::begin(remark), std::end(remark)),
                 std::end(remark));
    int K = (int)remark.size();
    for (int k = 1; k < K; k++)
      remark.emplace_back(lca(remark[k - 1], remark[k]));
    std::sort(std::begin(remark), std::end(remark), cmp);
    remark.erase(std::unique(std::begin(remark), std::end(remark)),
                 std::end(remark));
    std::vector<std::pair<int, int> > es;
    std::stack<int> st;
    for (auto& k : remark) {
      while (!st.empty() && out[st.top()] <= in[k]) st.pop();
      if (!st.empty()) es.emplace_back(st.top(), k);
      st.emplace(k);
    }
    return es;
  }

  explicit HeavyLightDecomposition(const Graph<T>& g) : Graph<T>(g) {}

 private:
  void dfs_sz(int idx, int p, int d) {
    dep[idx] = d;
    par[idx] = p;
    sz[idx] = 1;
    if (g[idx].size() && g[idx][0] == p) std::swap(g[idx][0], g[idx].back());
    for (auto& to : g[idx]) {
      if (to == p) continue;
      dfs_sz(to, idx, d + 1);
      sz[idx] += sz[to];
      if (sz[g[idx][0]] < sz[to]) std::swap(g[idx][0], to);
    }
  }

  void dfs_hld(int idx, int p, int& times) {
    in[idx] = times++;
    rev[in[idx]] = idx;
    for (auto& to : g[idx]) {
      if (to == p) continue;
      head[to] = (g[idx][0] == to ? head[idx] : to);
      dfs_hld(to, idx, times);
    }
    out[idx] = times;
  }
};
#line 11 "test/verify/aoj-2667.test.cpp"

using namespace std;

int main() {
  int N, Q;
  cin >> N >> Q;
  HeavyLightDecomposition<> hld(N);
  hld.read(N - 1, 0);
  hld.build();

  struct Query {
    int t, a, b;

    void input() { cin >> t >> a >> b; }
  };

  vector<int> remark;
  vector<Query> qs;
  vector<int64_t> sum(N);

  vector<int> index(N);
  for (int i = 0; i < Q; i++) {
    Query q;
    q.input();
    qs.emplace_back(q);
    if (q.t == 0) {
      remark.emplace_back(q.a);
      remark.emplace_back(q.b);
    } else {
      remark.emplace_back(q.a);
    }
    if (remark.size() >= 2000 || i + 1 == Q) {
      auto es = hld.compress(remark);
      for (int j = 0; j < remark.size(); j++) index[remark[j]] = j;
      vector<int> dist(remark.size()), par(remark.size());
      Graph<> h(remark.size());
      for (auto& p : es) {
        p.first = index[p.first];
        p.second = index[p.second];
        par[p.second] = p.first;
        dist[p.second] = hld.dist(remark[p.first], remark[p.second]);
        h.add_directed_edge(p.first, p.second);
      }
      vector<int64_t> lazy_add(N), backet_add(N);
      for (auto& q : qs) {
        if (q.t == 0) {
          int64_t ret = 0;
          ret += sum[q.a] + sum[q.b] - 2 * sum[hld.lca(q.a, q.b)];
          ret += backet_add[q.a] + backet_add[q.b] -
                 2 * backet_add[hld.lca(q.a, q.b)];
          cout << ret << "\n";
        } else {
          lazy_add[q.a] += q.b;
          q.a = index[q.a];
          function<void(int, int, int64_t)> dfs = [&](int idx, int p,
                                                      int64_t sz) {
            for (auto& to : h.g[idx]) {
              if (to != p) {
                backet_add[remark[to]] += (sz + dist[to]) * q.b;
                dfs(to, idx, sz + dist[to]);
              }
            }
          };
          dfs(q.a, par[q.a], 0);
        }
      }
      function<void(int, int, int64_t, int64_t)> dfs =
          [&](int idx, int par, int64_t add, int64_t all) {
            all += add;
            add += lazy_add[idx];
            sum[idx] += all;
            for (auto& to : hld.g[idx]) {
              if (to != par) dfs(to, idx, add, all);
            }
          };
      dfs(0, -1, 0, 0);
      qs.clear();
      remark.clear();
    }
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00	AC	3 ms	4 MB
g++	00_sample_01	AC	2 ms	4 MB
g++	10_small_00	AC	2 ms	4 MB
g++	10_small_01	AC	2 ms	4 MB
g++	10_small_02	AC	2 ms	4 MB
g++	10_small_03	AC	2 ms	4 MB
g++	10_small_04	AC	2 ms	4 MB
g++	10_small_05	AC	2 ms	4 MB
g++	10_small_06	AC	2 ms	4 MB
g++	10_small_07	AC	2 ms	4 MB
g++	10_small_08	AC	2 ms	4 MB
g++	10_small_09	AC	2 ms	4 MB
g++	10_small_10	AC	2 ms	4 MB
g++	10_small_11	AC	2 ms	4 MB
g++	10_small_12	AC	2 ms	4 MB
g++	10_small_13	AC	2 ms	4 MB
g++	10_small_14	AC	2 ms	4 MB
g++	10_small_15	AC	2 ms	4 MB
g++	10_small_16	AC	2 ms	4 MB
g++	10_small_17	AC	2 ms	4 MB
g++	10_small_18	AC	2 ms	4 MB
g++	10_small_19	AC	2 ms	3 MB
g++	10_small_20	AC	2 ms	4 MB
g++	10_small_21	AC	2 ms	4 MB
g++	10_small_22	AC	2 ms	4 MB
g++	10_small_23	AC	2 ms	4 MB
g++	10_small_24	AC	2 ms	3 MB
g++	11_manyadd_00	AC	1314 ms	30 MB
g++	11_manyadd_01	AC	1331 ms	30 MB
g++	11_manyadd_02	AC	1305 ms	30 MB
g++	11_manyadd_03	AC	1307 ms	30 MB
g++	11_manyadd_04	AC	1589 ms	23 MB
g++	11_manyadd_05	AC	1619 ms	23 MB
g++	11_manyadd_06	AC	1745 ms	23 MB
g++	11_manyadd_07	AC	2042 ms	24 MB
g++	12_manydist_00	AC	855 ms	30 MB
g++	12_manydist_01	AC	847 ms	30 MB
g++	12_manydist_02	AC	809 ms	30 MB
g++	12_manydist_03	AC	827 ms	30 MB
g++	12_manydist_04	AC	2987 ms	23 MB
g++	12_manydist_05	AC	2764 ms	24 MB
g++	12_manydist_06	AC	2889 ms	24 MB
g++	12_manydist_07	AC	2807 ms	23 MB
g++	13_fromroot_00	AC	1931 ms	23 MB
g++	13_fromroot_01	AC	2014 ms	24 MB
g++	13_fromroot_02	AC	1993 ms	23 MB
g++	13_fromroot_03	AC	2148 ms	23 MB
g++	14_maximum_00	AC	2394 ms	24 MB
g++	14_maximum_01	AC	2384 ms	24 MB
g++	14_maximum_02	AC	2396 ms	24 MB
g++	14_maximum_03	AC	2220 ms	24 MB
g++	15_dfskiller_00	AC	1675 ms	39 MB
g++	15_dfskiller_01	AC	1622 ms	39 MB
g++	16_manyleaves_00	AC	300 ms	22 MB
g++	16_manyleaves_01	AC	298 ms	23 MB
g++	17_leafroot_00	AC	3547 ms	23 MB
g++	17_leafroot_01	AC	3385 ms	23 MB
clang++	00_sample_00	AC	3 ms	4 MB
clang++	00_sample_01	AC	2 ms	4 MB
clang++	10_small_00	AC	2 ms	4 MB
clang++	10_small_01	AC	2 ms	4 MB
clang++	10_small_02	AC	2 ms	4 MB
clang++	10_small_03	AC	2 ms	4 MB
clang++	10_small_04	AC	2 ms	4 MB
clang++	10_small_05	AC	2 ms	4 MB
clang++	10_small_06	AC	2 ms	4 MB
clang++	10_small_07	AC	2 ms	4 MB
clang++	10_small_08	AC	2 ms	4 MB
clang++	10_small_09	AC	2 ms	4 MB
clang++	10_small_10	AC	2 ms	4 MB
clang++	10_small_11	AC	2 ms	4 MB
clang++	10_small_12	AC	2 ms	4 MB
clang++	10_small_13	AC	2 ms	4 MB
clang++	10_small_14	AC	2 ms	4 MB
clang++	10_small_15	AC	2 ms	4 MB
clang++	10_small_16	AC	2 ms	4 MB
clang++	10_small_17	AC	2 ms	4 MB
clang++	10_small_18	AC	2 ms	4 MB
clang++	10_small_19	AC	2 ms	4 MB
clang++	10_small_20	AC	2 ms	4 MB
clang++	10_small_21	AC	2 ms	4 MB
clang++	10_small_22	AC	2 ms	4 MB
clang++	10_small_23	AC	2 ms	4 MB
clang++	10_small_24	AC	2 ms	4 MB
clang++	11_manyadd_00	AC	1213 ms	29 MB
clang++	11_manyadd_01	AC	1257 ms	29 MB
clang++	11_manyadd_02	AC	1214 ms	29 MB
clang++	11_manyadd_03	AC	1221 ms	29 MB
clang++	11_manyadd_04	AC	1080 ms	23 MB
clang++	11_manyadd_05	AC	1369 ms	23 MB
clang++	11_manyadd_06	AC	1043 ms	23 MB
clang++	11_manyadd_07	AC	1167 ms	24 MB
clang++	12_manydist_00	AC	727 ms	29 MB
clang++	12_manydist_01	AC	743 ms	29 MB
clang++	12_manydist_02	AC	742 ms	29 MB
clang++	12_manydist_03	AC	756 ms	29 MB
clang++	12_manydist_04	AC	2619 ms	23 MB
clang++	12_manydist_05	AC	2253 ms	24 MB
clang++	12_manydist_06	AC	2234 ms	24 MB
clang++	12_manydist_07	AC	2464 ms	23 MB
clang++	13_fromroot_00	AC	1538 ms	23 MB
clang++	13_fromroot_01	AC	1448 ms	24 MB
clang++	13_fromroot_02	AC	1142 ms	23 MB
clang++	13_fromroot_03	AC	1170 ms	23 MB
clang++	14_maximum_00	AC	1376 ms	24 MB
clang++	14_maximum_01	AC	1327 ms	24 MB
clang++	14_maximum_02	AC	1586 ms	24 MB
clang++	14_maximum_03	AC	1423 ms	24 MB
clang++	15_dfskiller_00	AC	1440 ms	36 MB
clang++	15_dfskiller_01	AC	1430 ms	36 MB
clang++	16_manyleaves_00	AC	277 ms	22 MB
clang++	16_manyleaves_01	AC	286 ms	22 MB
clang++	17_leafroot_00	AC	3075 ms	23 MB
clang++	17_leafroot_01	AC	2849 ms	23 MB