test/vertex_get_range_contour_add_on_tree.test.cpp

• View this file on GitHub
• Last update: 2024-11-19 21:59:27+08:00
• Problem: https://judge.yosupo.jp/problem/vertex_get_range_contour_add_on_tree

Depends on

• default/t.cpp
• ds/centroidTree.cpp
• ds/fastJump.cpp
• ds/fenwickTree.cpp
• ds/hashTable.cpp

Code

#define PROBLEM "https://judge.yosupo.jp/problem/vertex_get_range_contour_add_on_tree"

#include <bits/extc++.h>
#include "../default/t.cpp"
#include "../ds/hashTable.cpp"
#include "../ds/fenwickTree.cpp"
#include "../ds/fastJump.cpp"
#include "../ds/centroidTree.cpp"

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, q; cin >> n >> q;
  vector<int> a(n);
  for(int &x : a)
    cin >> x;
  vector<vector<int>> g(n);
  for(int i = 1; i < n; i++) {
    int u, v; cin >> u >> v;
    g[u].emplace_back(v);
    g[v].emplace_back(u);
  }

  auto [g2, r] = centroidTree(g);

  vector<int> p(n, -1);
  auto dfs = [&](int v, auto self) -> void {
    for(int x : g2[v]) {
      if (x == p[v]) continue;
      p[x] = v;
      self(x, self);
    }
  };
  dfs(r, dfs);

  gp_hash_table<ll, int, custom_hash> toId({}, {}, {}, {}, {1 << 19});
  vector<vector<array<int, 2>>> cand(2 * n);
  vector<int> base(2 * n);
  vector<ll> init;
  init.reserve(1 << 19);
  fastJump fj(g);
  for(int s = 0; s < n; s++) {
    auto dfs = [&](int v, auto self) -> void {
      cand[s].push_back({fj.dis(s, v), v});
      if (p[s] != -1)
        cand[s + n].push_back({fj.dis(p[s], v), v});
      for(int x : g2[v]) {
        if (x == p[v]) continue;
        self(x, self);
      }
    };
    dfs(s, dfs);
    for(int d : {0, n}) {
      base[s + d] = ssize(init);
      ranges::sort(cand[s + d]);
      for(auto [_, v] : cand[s + d]) {
        toId[(ll)v << 32 | (s + d)] = ssize(init);
        init.emplace_back(a[v]);
      }
    }
  }

  adjacent_difference(init.begin(), init.end(), init.begin());
  fenwickTree<ll> ft(init);
  auto modify = [&](int v, int l, int r, int d) {
    int ql = base[v] + (ranges::lower_bound(cand[v], array<int, 2>{l, -1}) - cand[v].begin());
    int qr = base[v] + (ranges::lower_bound(cand[v], array<int, 2>{r, -1}) - cand[v].begin());
    ft.add(ql, d), ft.add(qr, -d);
  };

  while(q--) {
    int op; cin >> op;
    if (op == 0) {
      int x, l, r, d; cin >> x >> l >> r >> d;
      int v = x, pv = -1;
      while(v != -1) {
        int di = fj.dis(v, x);
        modify(v, l - di, r - di, d);
        if (pv != -1) {
          modify(pv + n, l - di, r - di, d);
        }
        pv = v, v = p[v];
      }
    } else {
      int x; cin >> x;
      int v = x, pv = -1;
      ll ans = 0;
      while(v != -1) {
        ans += ft.query(toId[(ll)x << 32 | v]);
        if (pv != -1)
          ans -= ft.query(toId[(ll)x << 32 | (pv + n)]);
        pv = v, v = p[v];
      }
      cout << ans << '\n';
    }
  }

  return 0;
}

#line 1 "test/vertex_get_range_contour_add_on_tree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/vertex_get_range_contour_add_on_tree"

#include <bits/extc++.h>
#line 22 "default/t.cpp"
#include <initializer_list>
#line 43 "default/t.cpp"
#include <type_traits>
#include <variant>
#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>

#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define clock chrono::steady_clock::now().time_since_epoch().count()

using namespace std;

template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(size_t i = 0; T x : arr) {
    os << x;
    if (++i != N) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(size_t i = 0; T x : vec) {
    os << x;
    if (++i != size(vec)) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(size_t i = 0; T x : s) {
    os << x;
    if (++i != size(s)) os << ' ';
  }
  return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2> &m) {
  for(size_t i = 0; pair<T1, T2> x : m) {
    os << x;
    if (++i != size(m)) os << ' ';
  }
  return os;
}

#ifdef DEBUG
#define dbg(...) cerr << '(', _do(#__VA_ARGS__), cerr << ") = ", _do2(__VA_ARGS__)
template<typename T> void _do(T &&x) { cerr << x; }
template<typename T, typename ...S> void _do(T &&x, S&&...y) { cerr << x << ", "; _do(y...); }
template<typename T> void _do2(T &&x) { cerr << x << endl; }
template<typename T, typename ...S> void _do2(T &&x, S&&...y) { cerr << x << ", "; _do2(y...); }
#else
#define dbg(...)
#endif

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using max_heap = priority_queue<T>;

template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP = plus<T>>
void pSum(rng &v) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = OP()(p, x);
}
template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP>
void pSum(rng &v, OP op) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = op(p, x);
}

template<ranges::forward_range rng>
void Unique(rng &v) {
  ranges::sort(v);
  v.resize(unique(v.begin(), v.end()) - v.begin());
}

template<ranges::random_access_range rng>
rng invPerm(rng p) {
  rng ret = p;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = i;
  return ret;
}

template<ranges::random_access_range rng, ranges::random_access_range rng2>
rng Permute(rng v, rng2 p) {
  rng ret = v;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = v[i];
  return ret;
}

template<bool directed>
vector<vector<int>> readGraph(int n, int m, int base) {
  vector<vector<int>> g(n);
  for(int i = 0; i < m; i++) {
    int u, v; cin >> u >> v;
    u -= base, v -= base;
    g[u].emplace_back(v);
    if constexpr (!directed)
      g[v].emplace_back(u);
  }
  return g;
}

template<class T>
void setBit(T &msk, int bit, bool x) {
  msk = (msk & ~(T(1) << bit)) | (T(x) << bit);
}
template<class T> void flipBit(T &msk, int bit) { msk ^= T(1) << bit; }
template<class T> bool getBit(T msk, int bit) { return msk >> bit & T(1); }

template<class T>
T floorDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? a / b : (a - b + 1) / b;
}
template<class T>
T ceilDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? (a + b - 1) / b : a / b;
}

template<class T> bool chmin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template<class T> bool chmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
#line 1 "ds/hashTable.cpp"
//source: https://codeforces.com/blog/entry/62393
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

using namespace __gnu_pbds;

//gp_hash_table<ll, int, custom_hash> m({}, {}, {}, {}, {1 << 16});
#line 1 "ds/fenwickTree.cpp"
template<class T>
struct fenwickTree {
  const int size;
  vector<T> data;

  fenwickTree(int _size) : size(_size + 1), data(_size + 1) {}
  fenwickTree(vector<T> &init) : size(ssize(init) + 1), data(ssize(init) + 1) {
    partial_sum(init.begin(), init.end(), data.begin() + 1);
    for(int i = size - 1; i > 0; i--)
      data[i] -= data[i - (i & (-i))];
  }

  void add(int i, T d) {
    for(i += 1; i < size; i += i & (-i))
      data[i] += d;
  }

  T query(int i) {
    T res = T(0);
    for(i += 1; i > 0; i -= i & (-i))
      res += data[i];
    return res;
  }

  T query(int l, int r) { //query [l, r)
    return query(r - 1) - query(l - 1);
  }
};
#line 1 "ds/fastJump.cpp"
struct fastJump {
  vector<int> p, jp, dep;

  fastJump(vector<vector<int>> g, int root = 0) : p(ssize(g)), jp(ssize(g)), dep(ssize(g)) {
    auto dfs = [&](int v, auto self) -> void {
      if (dep[p[v]] + dep[jp[jp[p[v]]]] == 2 * dep[jp[p[v]]])
        jp[v] = jp[jp[p[v]]];
      else
        jp[v] = p[v];

      for(int x : g[v]) {
        if (x == p[v]) continue;
        p[x] = v, dep[x] = dep[v] + 1;
        self(x, self);
      }
    };

    p[root] = jp[root] = root;
    dfs(root, dfs);
  }

  int jump(int v, int k) {
    k = min(k, dep[v]);
    while(k) {
      if (int d = dep[v] - dep[jp[v]]; d <= k)
        v = jp[v], k -= d;
      else
        v = p[v], k -= 1;
    }
    return v;
  }

  int lca(int u, int v) {
    if (dep[u] < dep[v])
      swap(u, v);
    u = jump(u, dep[u] - dep[v]);
    if (u == v) return u;
    while(p[u] != p[v]) {
      if (jp[u] != jp[v]) u = jp[u], v = jp[v];
      else u = p[u], v = p[v];
    }
    return p[u];
  }

  int kth(int s, int t, int k) {
    int m = lca(s, t);
    if (dep[s] + dep[t] - 2 * dep[m] < k)
      return -1;
    else if (dep[s] - dep[m] >= k)
      return jump(s, k);
    else
      return jump(t, dep[s] + dep[t] - 2 * dep[m] - k);
  }

  int dis(int u, int v) {
    return dep[u] + dep[v] - 2 * dep[lca(u, v)];
  }
};
#line 1 "ds/centroidTree.cpp"
pair<vector<vector<int>>, int> centroidTree(vector<vector<int>> &g) {
  int n = ssize(g);
  vector<vector<int>> g2(n);
  vector<int> sz(n);
  vector<bool> block(n, false);

  auto calc = [&](int v, int p, auto self) -> void {
    sz[v] = 1;
    for(int x : g[v]) {
      if (x == p or block[x]) continue;
      self(x, v, self);
      sz[v] += sz[x];
    }
  };

  auto dfs = [&](int v, auto self) -> int {
    calc(v, -1, calc);

    int c = v, p = -1;
    bool move;
    do {
      move = false;
      for(int x : g[c]) {
        if (x == p or block[x] or 2 * sz[x] <= sz[v]) continue;
        move = true, p = c, c = x;
        break;
      }
    } while(move);

    block[c] = true;
    for(int x : g[c]) {
      if (block[x]) continue;
      x = self(x, self);
      g2[c].emplace_back(x);
      g2[x].emplace_back(c);
    }

    return c;
  };

  int root = dfs(0, dfs);

  return make_pair(g2, root);
}
#line 9 "test/vertex_get_range_contour_add_on_tree.test.cpp"

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, q; cin >> n >> q;
  vector<int> a(n);
  for(int &x : a)
    cin >> x;
  vector<vector<int>> g(n);
  for(int i = 1; i < n; i++) {
    int u, v; cin >> u >> v;
    g[u].emplace_back(v);
    g[v].emplace_back(u);
  }

  auto [g2, r] = centroidTree(g);

  vector<int> p(n, -1);
  auto dfs = [&](int v, auto self) -> void {
    for(int x : g2[v]) {
      if (x == p[v]) continue;
      p[x] = v;
      self(x, self);
    }
  };
  dfs(r, dfs);

  gp_hash_table<ll, int, custom_hash> toId({}, {}, {}, {}, {1 << 19});
  vector<vector<array<int, 2>>> cand(2 * n);
  vector<int> base(2 * n);
  vector<ll> init;
  init.reserve(1 << 19);
  fastJump fj(g);
  for(int s = 0; s < n; s++) {
    auto dfs = [&](int v, auto self) -> void {
      cand[s].push_back({fj.dis(s, v), v});
      if (p[s] != -1)
        cand[s + n].push_back({fj.dis(p[s], v), v});
      for(int x : g2[v]) {
        if (x == p[v]) continue;
        self(x, self);
      }
    };
    dfs(s, dfs);
    for(int d : {0, n}) {
      base[s + d] = ssize(init);
      ranges::sort(cand[s + d]);
      for(auto [_, v] : cand[s + d]) {
        toId[(ll)v << 32 | (s + d)] = ssize(init);
        init.emplace_back(a[v]);
      }
    }
  }

  adjacent_difference(init.begin(), init.end(), init.begin());
  fenwickTree<ll> ft(init);
  auto modify = [&](int v, int l, int r, int d) {
    int ql = base[v] + (ranges::lower_bound(cand[v], array<int, 2>{l, -1}) - cand[v].begin());
    int qr = base[v] + (ranges::lower_bound(cand[v], array<int, 2>{r, -1}) - cand[v].begin());
    ft.add(ql, d), ft.add(qr, -d);
  };

  while(q--) {
    int op; cin >> op;
    if (op == 0) {
      int x, l, r, d; cin >> x >> l >> r >> d;
      int v = x, pv = -1;
      while(v != -1) {
        int di = fj.dis(v, x);
        modify(v, l - di, r - di, d);
        if (pv != -1) {
          modify(pv + n, l - di, r - di, d);
        }
        pv = v, v = p[v];
      }
    } else {
      int x; cin >> x;
      int v = x, pv = -1;
      ll ans = 0;
      while(v != -1) {
        ans += ft.query(toId[(ll)x << 32 | v]);
        if (pv != -1)
          ans -= ft.query(toId[(ll)x << 32 | (pv + n)]);
        pv = v, v = p[v];
      }
      cout << ans << '\n';
    }
  }

  return 0;
}

Back to top page