test/verify/aoj-2450-5.test.cpp

View this file on GitHub
Last update: 2024-07-28 19:56:12+09:00
Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2450

Depends on

Code

// competitive-verifier: PROBLEM https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2450

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

#include "../../structure/dynamic-tree/lazy-link-cut-tree.hpp"
#include "../../structure/dynamic-tree/dynamic-tree-builder-for-vertex.hpp"

struct TreeDPInfo {
  struct Lazy {
    int v;

    static constexpr Lazy id() { return {inf}; }

    void propagate(const Lazy &p) {
      if (p.v != inf) v = p.v;
    }
  };

  struct Path {
    int ans, all, suf, pref, sz;

    void propagate(const Lazy &p) {
      if (p.v != inf) {
        all = p.v * sz;
        ans = suf = pref = max(p.v, all);
      }
    }
  };

  struct Info {
    int v;

    void propagate(const Lazy &p) {
      if (p.v != inf) v = p.v;
    }
  };

  static Path vertex(const Info &u) {
    return {u.v, u.v, u.v, u.v, 1};
  }

  static Path compress(const Path &p, const Path &c) {
    return {max({p.ans, c.ans, p.suf + c.pref}), p.all + c.all, max(c.suf, p.suf + c.all), max(p.pref, c.pref + p.all),
            p.sz + c.sz};
  }
};

int main() {
  int N, Q;
  cin >> N >> Q;
  DynamicTreeBuilderForVertex< LazyLinkCutTree, TreeDPInfo > g(N);
  for(int i = 0; i < N; i++) {
    int x;
    cin >> x;
    g.set_vertex(i, {x});
  }
  for(int i = 1; i < N; i++) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    g.add_edge(a, b);
  }
  g.build();
  while(Q--) {
    int t, a, b, c;
    cin >> t >> a >> b >> c;
    --a, --b;
    if(t == 2) {
      cout << g.query_path(g.vs[a], g.vs[b]).ans << "\n";
    } else {
      g.set_propagate_path(g.vs[a], g.vs[b], {c});
    }
  }
}

#line 1 "test/verify/aoj-2450-5.test.cpp"
// competitive-verifier: PROBLEM https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2450

#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/aoj-2450-5.test.cpp"

#line 1 "structure/dynamic-tree/lazy-link-cut-tree.hpp"
template <typename TreeDPInfo>
struct LazyLinkCutTree {
  using Lazy = typename TreeDPInfo::Lazy;
  using Path = typename TreeDPInfo::Path;
  using Info = typename TreeDPInfo::Info;

 private:
  struct Node {
    Node *l, *r, *p;

    Info info;

    Path sum, mus;

    Lazy lazy;

    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),
          lazy(Lazy::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;
    }
  }

  void propagate(NP t, const Lazy &lazy) {
    t->lazy.propagate(lazy);
    t->info.propagate(lazy);
    t->sum.propagate(lazy);
    t->mus.propagate(lazy);
  }

 public:
  LazyLinkCutTree() = default;

  void push(NP t) {
    if (t->rev) {
      if (t->l) toggle(t->l);
      if (t->r) toggle(t->r);
      t->rev = false;
    }
    {
      if (t->l) propagate(t->l, t->lazy);
      if (t->r) propagate(t->r, t->lazy);
      t->lazy = Lazy::id();
    }
  }

  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::vertex(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);
      cur->r = rp;
      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_path(NP u) {
    expose(u);
    return u->sum;
  }

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

  void set_propagate_path(NP t, const Lazy &lazy) {
    expose(t);
    propagate(t, lazy);
    push(t);
    update(t);
  }

  void set_propagate_path(NP u, NP v, const Lazy &lazy) {
    evert(u);
    set_propagate_path(v, lazy);
  }

  template <typename C>
  pair<NP, Path> find_first(NP u, const C &check) {
    expose(u);
    Path sum = TreeDPInfo::vertex(u->info);
    if (check(sum)) return {u, sum};
    u = u->l;
    while (u) {
      push(u);
      if (u->r) {
        Path nxt = TreeDPInfo::compress(u->r->sum, sum);
        if (check(nxt)) {
          u = u->r;
          continue;
        }
        sum = nxt;
      }
      Path nxt = TreeDPInfo::compress(TreeDPInfo::vertex(u->info), sum);
      if (check(nxt)) {
        splay(u);
        return {u, nxt};
      }
      sum = nxt;
      u = u->l;
    }
    return {nullptr, sum};
  }
};

/*
struct TreeDPInfo {
  struct Lazy {
    static constexpr Lazy id() { return {inf}; }
    void propagate(const Lazy &p) {}
  };
  struct Path {
    void propagate(const Lazy& p) {}
  };
  struct Info {
    void propagate(const Lazy& p) {}
  };
  static Path vertex(const Info& u) {}
  static Path compress(const Path& p, const Path& c) {}
};
*/
#line 1 "structure/dynamic-tree/dynamic-tree-builder-for-vertex.hpp"
template <template <typename> typename DynamicTree, typename TreeDPInfo>
struct DynamicTreeBuilderForVertex : DynamicTree<TreeDPInfo> {
 private:
  using DT = DynamicTree<TreeDPInfo>;
  using Info = typename TreeDPInfo::Info;

  int n;
  vector<vector<int> > g;

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

  vector<typename DT::NP> vs;

  explicit DynamicTreeBuilderForVertex(int n) : n(n), g(n), vs(n) {}

  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) {
    assert(0 <= u and u < n);
    assert(0 <= v and v < n);
    assert(u != v);
    g[u].emplace_back(v);
    g[v].emplace_back(u);
  }

  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 : g[u]) {
        if (v == p) continue;
        que.emplace_back(v, u);
        link(vs[v], vs[u]);
      }
    }
  }
};
#line 7 "test/verify/aoj-2450-5.test.cpp"

struct TreeDPInfo {
  struct Lazy {
    int v;

    static constexpr Lazy id() { return {inf}; }

    void propagate(const Lazy &p) {
      if (p.v != inf) v = p.v;
    }
  };

  struct Path {
    int ans, all, suf, pref, sz;

    void propagate(const Lazy &p) {
      if (p.v != inf) {
        all = p.v * sz;
        ans = suf = pref = max(p.v, all);
      }
    }
  };

  struct Info {
    int v;

    void propagate(const Lazy &p) {
      if (p.v != inf) v = p.v;
    }
  };

  static Path vertex(const Info &u) {
    return {u.v, u.v, u.v, u.v, 1};
  }

  static Path compress(const Path &p, const Path &c) {
    return {max({p.ans, c.ans, p.suf + c.pref}), p.all + c.all, max(c.suf, p.suf + c.all), max(p.pref, c.pref + p.all),
            p.sz + c.sz};
  }
};

int main() {
  int N, Q;
  cin >> N >> Q;
  DynamicTreeBuilderForVertex< LazyLinkCutTree, TreeDPInfo > g(N);
  for(int i = 0; i < N; i++) {
    int x;
    cin >> x;
    g.set_vertex(i, {x});
  }
  for(int i = 1; i < N; i++) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    g.add_edge(a, b);
  }
  g.build();
  while(Q--) {
    int t, a, b, c;
    cin >> t >> a >> b >> c;
    --a, --b;
    if(t == 2) {
      cout << g.query_path(g.vs[a], g.vs[b]).ans << "\n";
    } else {
      g.set_propagate_path(g.vs[a], g.vs[b], {c});
    }
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	testcase_00	AC	5 ms	3 MB
g++	testcase_01	AC	5 ms	3 MB
g++	testcase_02	AC	5 ms	3 MB
g++	testcase_03	AC	5 ms	3 MB
g++	testcase_04	AC	5 ms	4 MB
g++	testcase_05	AC	201 ms	6 MB
g++	testcase_06	AC	326 ms	19 MB
g++	testcase_07	AC	476 ms	35 MB
g++	testcase_08	AC	5 ms	3 MB
g++	testcase_09	AC	13 ms	4 MB
g++	testcase_10	AC	154 ms	37 MB
g++	testcase_11	AC	5 ms	3 MB
g++	testcase_12	AC	5 ms	3 MB
g++	testcase_13	AC	5 ms	4 MB
g++	testcase_14	AC	7 ms	4 MB
g++	testcase_15	AC	24 ms	4 MB
g++	testcase_16	AC	128 ms	5 MB
g++	testcase_17	AC	212 ms	11 MB
g++	testcase_18	AC	274 ms	19 MB
g++	testcase_19	AC	398 ms	35 MB
g++	testcase_20	AC	5 ms	3 MB
g++	testcase_21	AC	5 ms	3 MB
g++	testcase_22	AC	12 ms	3 MB
g++	testcase_23	AC	77 ms	5 MB
g++	testcase_24	AC	262 ms	15 MB
g++	testcase_25	AC	320 ms	34 MB
g++	testcase_26	AC	5 ms	3 MB
g++	testcase_27	AC	178 ms	6 MB
g++	testcase_28	AC	274 ms	19 MB
g++	testcase_29	AC	390 ms	35 MB
g++	testcase_30	AC	6 ms	3 MB
g++	testcase_31	AC	7 ms	3 MB
g++	testcase_32	AC	33 ms	4 MB
g++	testcase_33	AC	160 ms	8 MB
g++	testcase_34	AC	228 ms	19 MB
g++	testcase_35	AC	330 ms	33 MB
g++	testcase_36	AC	335 ms	34 MB
g++	testcase_37	AC	348 ms	34 MB
g++	testcase_38	AC	351 ms	34 MB
clang++	testcase_00	AC	5 ms	3 MB
clang++	testcase_01	AC	5 ms	3 MB
clang++	testcase_02	AC	5 ms	3 MB
clang++	testcase_03	AC	5 ms	3 MB
clang++	testcase_04	AC	6 ms	3 MB
clang++	testcase_05	AC	205 ms	6 MB
clang++	testcase_06	AC	336 ms	19 MB
clang++	testcase_07	AC	494 ms	35 MB
clang++	testcase_08	AC	5 ms	3 MB
clang++	testcase_09	AC	15 ms	4 MB
clang++	testcase_10	AC	158 ms	37 MB
clang++	testcase_11	AC	5 ms	3 MB
clang++	testcase_12	AC	5 ms	3 MB
clang++	testcase_13	AC	5 ms	3 MB
clang++	testcase_14	AC	7 ms	3 MB
clang++	testcase_15	AC	25 ms	4 MB
clang++	testcase_16	AC	129 ms	5 MB
clang++	testcase_17	AC	216 ms	11 MB
clang++	testcase_18	AC	276 ms	19 MB
clang++	testcase_19	AC	394 ms	35 MB
clang++	testcase_20	AC	5 ms	3 MB
clang++	testcase_21	AC	5 ms	3 MB
clang++	testcase_22	AC	11 ms	3 MB
clang++	testcase_23	AC	79 ms	5 MB
clang++	testcase_24	AC	256 ms	15 MB
clang++	testcase_25	AC	325 ms	35 MB
clang++	testcase_26	AC	5 ms	3 MB
clang++	testcase_27	AC	179 ms	6 MB
clang++	testcase_28	AC	273 ms	19 MB
clang++	testcase_29	AC	393 ms	35 MB
clang++	testcase_30	AC	5 ms	3 MB
clang++	testcase_31	AC	7 ms	4 MB
clang++	testcase_32	AC	33 ms	4 MB
clang++	testcase_33	AC	161 ms	8 MB
clang++	testcase_34	AC	233 ms	19 MB
clang++	testcase_35	AC	343 ms	33 MB
clang++	testcase_36	AC	356 ms	34 MB
clang++	testcase_37	AC	354 ms	34 MB
clang++	testcase_38	AC	351 ms	34 MB