Luzhiled's Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub ei1333/library

:heavy_check_mark: test/verify/yosupo-point-set-tree-path-composite-sum.test.cpp

Depends on

Code

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

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

#include "../../math/combinatorics/montgomery-mod-int.hpp"
#include "../../structure/dynamic-tree/vertex-set-tree-path-composite-sum.hpp"
#include "../../structure/dynamic-tree/dynamic-tree-builder-for-edge.hpp"

using mint = modint998244353;

int main() {
  int N, Q;
  cin >> N >> Q;
  DynamicTreeBuilderForEdge< LinkCutTreeForSubtree,
      VertexSetTreePathCompositeSum< mint > > g(N);
  for (int i = 0; i < N; i++) {
    int a;
    cin >> a;
    g.set_vertex(i, {true, a, 0});
  }
  for (int i = 0; i + 1 < N; i++) {
    int u, v, b, c;
    cin >> u >> v >> b >> c;
    g.add_edge(u, v, {false, b, c});
  }
  g.build();
  while (Q--) {
    int t;
    cin >> t;
    if (t == 0) {
      int w, x;
      cin >> w >> x;
      g.set_key(g.vs[w], {true, x, 0});
    } else {
      int e, y, z;
      cin >> e >> y >> z;
      g.set_key(g.es[e], {false, y, z});
    }
    int r;
    cin >> r;
    cout << g.query(g.vs[r]).s.val() << "\n";
  }
}

#line 1 "test/verify/yosupo-point-set-tree-path-composite-sum.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/point_set_tree_path_composite_sum

#line 1 "template/template.hpp"
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif

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(std::forward<F>(f)) {}

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

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

#line 2 "math/combinatorics/montgomery-mod-int.hpp"

template <uint32_t mod_, bool fast = false>
struct MontgomeryModInt {
 private:
  using mint = MontgomeryModInt;
  using i32 = int32_t;
  using i64 = int64_t;
  using u32 = uint32_t;
  using u64 = uint64_t;

  static constexpr u32 get_r() {
    u32 ret = mod_;
    for (i32 i = 0; i < 4; i++) ret *= 2 - mod_ * ret;
    return ret;
  }

  static constexpr u32 r = get_r();

  static constexpr u32 n2 = -u64(mod_) % mod_;

  static_assert(r * mod_ == 1, "invalid, r * mod != 1");
  static_assert(mod_ < (1 << 30), "invalid, mod >= 2 ^ 30");
  static_assert((mod_ & 1) == 1, "invalid, mod % 2 == 0");

  u32 x;

 public:
  MontgomeryModInt() : x{} {}

  MontgomeryModInt(const i64 &a)
      : x(reduce(u64(fast ? a : (a % mod() + mod())) * n2)) {}

  static constexpr u32 reduce(const u64 &b) {
    return u32(b >> 32) + mod() - u32((u64(u32(b) * r) * mod()) >> 32);
  }

  mint &operator+=(const mint &p) {
    if (i32(x += p.x - 2 * mod()) < 0) x += 2 * mod();
    return *this;
  }

  mint &operator-=(const mint &p) {
    if (i32(x -= p.x) < 0) x += 2 * mod();
    return *this;
  }

  mint &operator*=(const mint &p) {
    x = reduce(u64(x) * p.x);
    return *this;
  }

  mint &operator/=(const mint &p) {
    *this *= p.inv();
    return *this;
  }

  mint operator-() const { return mint() - *this; }

  mint operator+(const mint &p) const { return mint(*this) += p; }

  mint operator-(const mint &p) const { return mint(*this) -= p; }

  mint operator*(const mint &p) const { return mint(*this) *= p; }

  mint operator/(const mint &p) const { return mint(*this) /= p; }

  bool operator==(const mint &p) const {
    return (x >= mod() ? x - mod() : x) == (p.x >= mod() ? p.x - mod() : p.x);
  }

  bool operator!=(const mint &p) const {
    return (x >= mod() ? x - mod() : x) != (p.x >= mod() ? p.x - mod() : p.x);
  }

  u32 val() const {
    u32 ret = reduce(x);
    return ret >= mod() ? ret - mod() : ret;
  }

  mint pow(u64 n) const {
    mint ret(1), mul(*this);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  mint inv() const { return pow(mod() - 2); }

  friend ostream &operator<<(ostream &os, const mint &p) {
    return os << p.val();
  }

  friend istream &operator>>(istream &is, mint &a) {
    i64 t;
    is >> t;
    a = mint(t);
    return is;
  }

  static constexpr u32 mod() { return mod_; }
};

template <uint32_t mod>
using modint = MontgomeryModInt<mod>;
using modint998244353 = modint<998244353>;
using modint1000000007 = modint<1000000007>;
#line 1 "structure/dynamic-tree/link-cut-tree-for-subtree.hpp"
template <typename TreeDPInfo>
struct LinkCutTreeForSubtree {
  using Point = typename TreeDPInfo::Point;
  using Path = typename TreeDPInfo::Path;
  using Info = typename TreeDPInfo::Info;

 private:
  struct Node {
    Node *l, *r, *p;
    Info info;
    Path sum, mus;

    Point point;
    bool rev;

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

    Node(const Info &info)
        : info(info),
          l(nullptr),
          r(nullptr),
          p(nullptr),
          rev(false),
          point(Point::id()) {}
  };

 public:
  using NP = Node *;

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

  void rotr(NP t) {
    NP x = t->p, y = x->p;
    push(x), push(t);
    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;
    }
  }

  void rotl(NP t) {
    NP x = t->p, y = x->p;
    push(x), push(t);
    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;
    }
  }

 public:
  LinkCutTreeForSubtree() = default;

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

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

  void update(NP t) {
    Path key = TreeDPInfo::add_vertex(t->point, t->info);
    t->sum = key;
    t->mus = key;
    if (t->l) {
      t->sum = TreeDPInfo::compress(t->l->sum, t->sum);
      t->mus = TreeDPInfo::compress(t->mus, t->l->mus);
    }
    if (t->r) {
      t->sum = TreeDPInfo::compress(t->sum, t->r->sum);
      t->mus = TreeDPInfo::compress(t->r->mus, t->mus);
    }
  }

  void splay(NP t) {
    push(t);
    while (not t->is_root()) {
      NP q = t->p;
      if (q->is_root()) {
        push_rev(q), push_rev(t);
        if (q->l == t)
          rotr(t);
        else
          rotl(t);
      } else {
        NP r = q->p;
        push_rev(r), push_rev(q), push_rev(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);
        }
      }
    }
  }

  NP expose(NP t) {
    NP rp = nullptr;
    for (NP cur = t; cur; cur = cur->p) {
      splay(cur);
      if (cur->r) {
        cur->point =
            TreeDPInfo::rake(cur->point, TreeDPInfo::add_edge(cur->r->sum));
      }
      cur->r = rp;
      if (cur->r) {
        cur->point = TreeDPInfo::rake(cur->point,
                                      TreeDPInfo::add_edge(cur->r->sum).inv());
      }
      update(cur);
      rp = cur;
    }
    splay(t);
    return rp;
  }

  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);
  }

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

  NP alloc(const Info &v) {
    NP t = new Node(v);
    update(t);
    return t;
  }

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

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

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

  void set_key(NP t, const Info &v) {
    expose(t);
    t->info = std::move(v);
    update(t);
  }

  const Path &query(NP u) {
    evert(u);
    return u->sum;
  }

  const Path &query_path(NP u) {
    expose(u);
    return u->sum;
  }

  const Path &query_path(NP u, NP v) {
    evert(u);
    return query_path(v);
  }

  Path query_subtree(NP u) {
    expose(u);
    NP l = u->l;
    u->l = nullptr;
    update(u);
    auto ret = u->sum;
    u->l = l;
    update(u);
    return ret;
  }

  Path query_subtree(NP r, NP u) {
    evert(r);
    return query_subtree(u);
  }
};

/*
struct TreeDPInfo {
  struct Point {
    static constexpr Point id() {}
    Point inv() const {}
  };
  struct Path {};
  struct Info {};
  static Path add_vertex(const Point& d, const Info& u) {}
  static Point add_edge(const Path& d) {}
  static Point rake(const Point& s, const Point& p) {}
  static Path compress(const Path& p, const Path& c) {}
};
*/
#line 2 "structure/dynamic-tree/vertex-set-tree-path-composite-sum.hpp"

template <typename T>
struct VertexSetTreePathCompositeSum {
  struct Point {
    T s, x;
    static constexpr Point id() { return {0, 0}; }
    Point inv() const { return {-s, -x}; }
  };
  struct Path {
    T a, b, s, x;
  };
  struct Info {
    bool is_vertex;
    T x, y;
  };

  static Path add_vertex(const Point& d, const Info& u) {
    if (u.is_vertex) return {1, 0, d.s + u.x, d.x + 1};
    return {u.x, u.y, d.s * u.x + d.x * u.y, d.x};
  }
  static Point add_edge(const Path& d) { return {d.s, d.x}; }
  static Point rake(const Point& s, const Point& p) {
    return {s.s + p.s, s.x + p.x};
  }
  static Path compress(const Path& p, const Path& c) {
    return {p.a * c.a, p.a * c.b + p.b, p.s + p.a * c.s + p.b * c.x, p.x + c.x};
  }
};
#line 1 "structure/dynamic-tree/dynamic-tree-builder-for-edge.hpp"
template <template <typename> typename DynamicTree, typename TreeDPInfo>
struct DynamicTreeBuilderForEdge : DynamicTree<TreeDPInfo> {
 private:
  using DT = DynamicTree<TreeDPInfo>;
  using Info = typename TreeDPInfo::Info;

  int n, e_sz;
  vector<vector<pair<int, int> > > g;

 public:
  using DT::alloc;
  using DT::link;

  vector<typename DT::NP> vs, es;

  explicit DynamicTreeBuilderForEdge(int n)
      : n(n), g(n), vs(n), es(n), e_sz(0) {}

  void set_vertex(int u, const Info &info) {
    assert(0 <= u and u < n);
    vs[u] = this->alloc(info);
  }

  void add_edge(int u, int v, const Info &info, int id = -1) {
    assert(0 <= u and u < n);
    assert(0 <= v and v < n);
    assert(u != v);
    if (id == -1) id = e_sz++;
    assert(0 <= id and id < n);
    g[u].emplace_back(v, id);
    g[v].emplace_back(u, id);
    es[id] = alloc(info);
  }

  void build(int r = 0) {
    vector<pair<int, int> > que;
    que.reserve(n);
    que.emplace_back(r, -1);
    while (not que.empty()) {
      auto [u, p] = que.back();
      que.pop_back();
      for (auto &[v, id] : g[u]) {
        if (v == p) continue;
        que.emplace_back(v, u);
        link(es[id], vs[u]);
        link(vs[v], es[id]);
      }
    }
  }
};
#line 8 "test/verify/yosupo-point-set-tree-path-composite-sum.test.cpp"

using mint = modint998244353;

int main() {
  int N, Q;
  cin >> N >> Q;
  DynamicTreeBuilderForEdge< LinkCutTreeForSubtree,
      VertexSetTreePathCompositeSum< mint > > g(N);
  for (int i = 0; i < N; i++) {
    int a;
    cin >> a;
    g.set_vertex(i, {true, a, 0});
  }
  for (int i = 0; i + 1 < N; i++) {
    int u, v, b, c;
    cin >> u >> v >> b >> c;
    g.add_edge(u, v, {false, b, c});
  }
  g.build();
  while (Q--) {
    int t;
    cin >> t;
    if (t == 0) {
      int w, x;
      cin >> w >> x;
      g.set_key(g.vs[w], {true, x, 0});
    } else {
      int e, y, z;
      cin >> e >> y >> z;
      g.set_key(g.es[e], {false, y, z});
    }
    int r;
    cin >> r;
    cout << g.query(g.vs[r]).s.val() << "\n";
  }
}

Test cases

Env Name Status Elapsed Memory
g++ example_00 :heavy_check_mark: AC 5 ms 3 MB
g++ example_01 :heavy_check_mark: AC 4 ms 3 MB
g++ n_hundreds_00 :heavy_check_mark: AC 5 ms 4 MB
g++ n_hundreds_01 :heavy_check_mark: AC 5 ms 4 MB
g++ tiny_00 :heavy_check_mark: AC 4 ms 3 MB
g++ tiny_01 :heavy_check_mark: AC 4 ms 3 MB
g++ typical_tree_max_00 :heavy_check_mark: AC 1286 ms 55 MB
g++ typical_tree_max_01 :heavy_check_mark: AC 379 ms 58 MB
g++ typical_tree_max_02 :heavy_check_mark: AC 1265 ms 57 MB
g++ typical_tree_max_03 :heavy_check_mark: AC 1284 ms 55 MB
g++ typical_tree_max_04 :heavy_check_mark: AC 1189 ms 58 MB
g++ typical_tree_max_05 :heavy_check_mark: AC 721 ms 57 MB
g++ typical_tree_max_06 :heavy_check_mark: AC 993 ms 56 MB
g++ typical_tree_max_07 :heavy_check_mark: AC 1368 ms 55 MB
g++ typical_tree_max_08 :heavy_check_mark: AC 1027 ms 56 MB
g++ typical_tree_max_09 :heavy_check_mark: AC 479 ms 56 MB
clang++ example_00 :heavy_check_mark: AC 5 ms 3 MB
clang++ example_01 :heavy_check_mark: AC 5 ms 3 MB
clang++ n_hundreds_00 :heavy_check_mark: AC 5 ms 4 MB
clang++ n_hundreds_01 :heavy_check_mark: AC 5 ms 4 MB
clang++ tiny_00 :heavy_check_mark: AC 5 ms 3 MB
clang++ tiny_01 :heavy_check_mark: AC 5 ms 3 MB
clang++ typical_tree_max_00 :heavy_check_mark: AC 1391 ms 55 MB
clang++ typical_tree_max_01 :heavy_check_mark: AC 404 ms 58 MB
clang++ typical_tree_max_02 :heavy_check_mark: AC 1331 ms 57 MB
clang++ typical_tree_max_03 :heavy_check_mark: AC 1359 ms 55 MB
clang++ typical_tree_max_04 :heavy_check_mark: AC 1281 ms 58 MB
clang++ typical_tree_max_05 :heavy_check_mark: AC 761 ms 57 MB
clang++ typical_tree_max_06 :heavy_check_mark: AC 960 ms 56 MB
clang++ typical_tree_max_07 :heavy_check_mark: AC 1381 ms 55 MB
clang++ typical_tree_max_08 :heavy_check_mark: AC 1098 ms 56 MB
clang++ typical_tree_max_09 :heavy_check_mark: AC 495 ms 56 MB
Back to top page