test/verify/yosupo-dynamic-tree-vertex-add-path-sum.test.cpp

View this file on GitHub
Last update: 2024-04-27 01:27:28+09:00
Problem: https://judge.yosupo.jp/problem/dynamic_tree_vertex_add_path_sum

Depends on

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/dynamic_tree_vertex_add_path_sum

#include "../../template/template.hpp"

#include "../../structure/lct/link-cut-tree.hpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  auto add = [](int64 a, int64 b) { return a + b; };
  auto s = [](int64 a) { return a; };
  auto lct = get_link_cut_tree< int64 >(add, s);

  vector< int64 > A(N);
  cin >> A;

  auto vs = lct.build(A);
  for(int i = 1; i < N; i++) {
    int a, b;
    cin >> a >> b;
    lct.evert(vs[a]);
    lct.link(vs[a], vs[b]);
  }

  while(Q--) {
    int T;
    cin >> T;
    if(T == 0) {
      int U, V, W, X;
      cin >> U >> V >> W >> X;
      lct.evert(vs[U]);
      lct.cut(vs[V]);
      lct.evert(vs[W]);
      lct.link(vs[W], vs[X]);
    } else if(T == 1) {
      int P, X;
      cin >> P >> X;
      lct.set_key(vs[P], vs[P]->key + X);
    } else {
      int U, V;
      cin >> U >> V;
      cout << lct.query(vs[U], vs[V]) << "\n";
    }
  }
}

#line 1 "test/verify/yosupo-dynamic-tree-vertex-add-path-sum.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/dynamic_tree_vertex_add_path_sum

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/yosupo-dynamic-tree-vertex-add-path-sum.test.cpp"

#line 1 "structure/lct/link-cut-tree.hpp"
/**
 * @brief Link Cut Tree
 *
 */
template <typename T, typename F, typename S>
struct LinkCutTree {
 private:
  F f;
  S s;

  struct Node {
    Node *l, *r, *p;
    T key, sum;
    bool rev;
    size_t sz;

    explicit Node(const T &v)
        : key(v),
          sum(v),
          sz(1),
          rev(false),
          l(nullptr),
          r(nullptr),
          p(nullptr) {}

    bool is_root() const { return not p or (p->l != this and p->r != this); }
  };

 public:
  using NP = Node *;

 private:
  NP update(NP t) {
    t->sz = 1;
    t->sum = t->key;
    if (t->l) t->sz += t->l->sz, t->sum = f(t->l->sum, t->sum);
    if (t->r) t->sz += t->r->sz, t->sum = f(t->sum, t->r->sum);
    return t;
  }

  void rotr(NP t) {
    NP x = t->p, y = x->p;
    if ((x->l = t->r)) t->r->p = x;
    t->r = x, x->p = t;
    update(x), update(t);
    if ((t->p = y)) {
      if (y->l == x) y->l = t;
      if (y->r == x) y->r = t;
      update(y);
    }
  }

  void rotl(NP t) {
    NP x = t->p, y = x->p;
    if ((x->r = t->l)) t->l->p = x;
    t->l = x, x->p = t;
    update(x), update(t);
    if ((t->p = y)) {
      if (y->l == x) y->l = t;
      if (y->r == x) y->r = t;
      update(y);
    }
  }

  void toggle(NP t) {
    swap(t->l, t->r);
    t->sum = s(t->sum);
    t->rev ^= true;
  }

  void push(NP t) {
    if (t->rev) {
      if (t->l) toggle(t->l);
      if (t->r) toggle(t->r);
      t->rev = false;
    }
  }

  void splay(NP t) {
    push(t);
    while (not t->is_root()) {
      NP q = t->p;
      if (q->is_root()) {
        push(q), push(t);
        if (q->l == t)
          rotr(t);
        else
          rotl(t);
      } else {
        NP r = q->p;
        push(r), push(q), push(t);
        if (r->l == q) {
          if (q->l == t)
            rotr(q), rotr(t);
          else
            rotl(t), rotr(t);
        } else {
          if (q->r == t)
            rotl(q), rotl(t);
          else
            rotr(t), rotl(t);
        }
      }
    }
  }

 public:
  LinkCutTree(const F &f, const S &s) : f(f), s(s) {}

  NP alloc(const T &v = T()) { return new Node(v); }

  vector<NP> build(vector<T> &vs) {
    vector<NP> nodes(vs.size());
    for (int i = 0; i < (int)vs.size(); i++) {
      nodes[i] = alloc(vs[i]);
    }
    return nodes;
  }

  NP expose(NP t) {
    NP rp = nullptr;
    for (NP cur = t; cur; cur = cur->p) {
      splay(cur);
      cur->r = rp;
      update(cur);
      rp = cur;
    }
    splay(t);
    return rp;
  }

  void evert(NP t) {
    expose(t);
    toggle(t);
    push(t);
  }

  void link(NP child, NP parent) {
    if (is_connected(child, parent)) {
      throw runtime_error(
          "child and parent must be different connected components");
    }
    if (child->l) {
      throw runtime_error("child must be root");
    }
    child->p = parent;
    parent->r = child;
    update(parent);
  }

  void cut(NP child) {
    expose(child);
    NP parent = child->l;
    if (not parent) {
      throw runtime_error("child must not be root");
    }
    child->l = nullptr;
    parent->p = nullptr;
    update(child);
  }

  bool is_connected(NP u, NP v) {
    expose(u), expose(v);
    return u == v or u->p;
  }

  NP lca(NP u, NP v) {
    if (not is_connected(u, v)) return nullptr;
    expose(u);
    return expose(v);
  }

  NP get_kth(NP x, int k) {
    expose(x);
    while (x) {
      push(x);
      if (x->r && x->r->sz > k) {
        x = x->r;
      } else {
        if (x->r) k -= x->r->sz;
        if (k == 0) {
          splay(x);
          return x;
        }
        k -= 1;
        x = x->l;
      }
    }
    return nullptr;
  }

  const T &query(NP u) {
    expose(u);
    return u->sum;
  }

  const T &query(NP u, NP v) {
    evert(u);
    return query(v);
  }

  void set_key(NP t, T v) {
    expose(t);
    t->key = v;
    update(t);
  }
};

template <typename T, typename F, typename S>
LinkCutTree<T, F, S> get_link_cut_tree(const F &f, const S &s) {
  return {f, s};
}
#line 6 "test/verify/yosupo-dynamic-tree-vertex-add-path-sum.test.cpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  auto add = [](int64 a, int64 b) { return a + b; };
  auto s = [](int64 a) { return a; };
  auto lct = get_link_cut_tree< int64 >(add, s);

  vector< int64 > A(N);
  cin >> A;

  auto vs = lct.build(A);
  for(int i = 1; i < N; i++) {
    int a, b;
    cin >> a >> b;
    lct.evert(vs[a]);
    lct.link(vs[a], vs[b]);
  }

  while(Q--) {
    int T;
    cin >> T;
    if(T == 0) {
      int U, V, W, X;
      cin >> U >> V >> W >> X;
      lct.evert(vs[U]);
      lct.cut(vs[V]);
      lct.evert(vs[W]);
      lct.link(vs[W], vs[X]);
    } else if(T == 1) {
      int P, X;
      cin >> P >> X;
      lct.set_key(vs[P], vs[P]->key + X);
    } else {
      int U, V;
      cin >> U >> V;
      cout << lct.query(vs[U], vs[V]) << "\n";
    }
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	6 ms	4 MB
g++	max_random_00	AC	374 ms	19 MB
g++	max_random_01	AC	345 ms	19 MB
g++	max_random_02	AC	356 ms	19 MB
g++	random_00	AC	217 ms	13 MB
g++	random_01	AC	245 ms	15 MB
g++	random_02	AC	129 ms	8 MB
g++	random_03	AC	146 ms	16 MB
g++	random_04	AC	80 ms	5 MB
g++	small_00	AC	6 ms	4 MB
g++	small_01	AC	6 ms	4 MB
g++	small_02	AC	6 ms	4 MB
clang++	example_00	AC	6 ms	4 MB
clang++	max_random_00	AC	376 ms	19 MB
clang++	max_random_01	AC	364 ms	19 MB
clang++	max_random_02	AC	356 ms	19 MB
clang++	random_00	AC	219 ms	13 MB
clang++	random_01	AC	245 ms	15 MB
clang++	random_02	AC	131 ms	8 MB
clang++	random_03	AC	157 ms	16 MB
clang++	random_04	AC	82 ms	5 MB
clang++	small_00	AC	7 ms	4 MB
clang++	small_01	AC	6 ms	4 MB
clang++	small_02	AC	6 ms	4 MB