Luzhiled's Library

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub ei1333/library

:heavy_check_mark: test/verify/aoj-2450-3.test.cpp

Depends on

Code

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

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

#include "../../structure/develop/splay-tree-base.hpp"
#include "../../structure/develop/reversible-splay-tree.hpp"
#include "../../structure/develop/lazy-reversible-splay-tree.hpp"
#include "../../structure/develop/link-cut-tree.hpp"

int main() {
  int N, Q, S[200000];
  cin >> N >> Q;

  struct Node {
    int64 ans, all, left, right, length;

    Node() : ans(-infll), all(0), left(-infll), right(-infll), length(0) {}

    Node(int64 val, int64 len) : length(len) {
      all = val * len;
      ans = left = right = (val > 0 ? all : val);
    }

    Node operator+(const Node &s) const {
      Node ret;
      ret.length = length + s.length;
      ret.ans = max({ans, s.ans, right + s.left});
      ret.all = all + s.all;
      ret.left = max(left, all + s.left);
      ret.right = max(s.right, right + s.all);
      return ret;
    }
  };
  auto F = [](const Node &a, const Node &b) { return a + b; };
  auto G = [](const Node &a, int64 x) { return Node(x, a.length); };
  auto H = [](int64, int64 y) { return y; };
  auto T = [](Node a) {
    swap(a.left, a.right);
    return a;
  };


  using LCT = LinkCutTree< LRST< Node, int64 > >;
  LCT lct(F, G, H, T, Node(), infll);
  vector< LCT::Node * > vs(N);

  for(int i = 0; i < N; i++) {
    cin >> S[i];
    vs[i] = lct.alloc(Node(S[i], 1));
  }
  for(int i = 0; i < N - 1; i++) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    lct.evert(vs[v]);
    lct.link(vs[v], vs[u]);
  }
  while(Q--) {
    int X, A, B, C;
    cin >> X >> A >> B >> C;
    --A, --B;
    if(X == 1) {
      lct.evert(vs[A]);
      lct.expose(vs[B]);
      lct.set_propagate(vs[B], C);
    } else {
      lct.evert(vs[A]);
      lct.expose(vs[B]);
      cout << vs[B]->sum.ans << "\n";
    }
  }
}

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

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

#line 1 "structure/develop/splay-tree-base.hpp"
/**
 * @brief Splay-Tree-Base(Splay木)
 */
template< typename Node >
struct SplayTreeBase {
public:
  using NP = Node *;

  bool is_root(const NP &t) const { return !t->p || (t->p->l != t && t->p->r != t); }

  inline size_t count(const NP &t) const { return t ? t->sz : 0; }

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

  NP erase(NP t) {
    splay(t);
    Node *x = t->l, *y = t->r;
    delete t;
    if(!x) {
      t = y;
      if(t) t->p = nullptr;
    } else if(!y) {
      t = x;
      t->p = nullptr;
    } else {
      x->p = nullptr;
      t = get_right(x);
      splay(t);
      t->r = y;
      y->p = t;
    }
    return t;
  }

  NP splay_front(NP t) {
    splay(t);
    while(t->l) t = t->l;
    splay(t);
    return t;
  }

  NP splay_back(NP t) {
    splay(t);
    while(t->r) t = t->r;
    splay(t);
    return t;
  }

  pair< NP, NP > split(NP t, int k) {
    if(!t) return {nullptr, nullptr};
    push(t);
    if(k <= count(t->l)) {
      auto x = split(t->l, k);
      t->l = x.second;
      t->p = nullptr;
      if(x.second) x.second->p = t;
      return {x.first, update(t)};
    } else {
      auto x = split(t->r, k - count(t->l) - 1);
      t->r = x.first;
      t->p = nullptr;
      if(x.first) x.first->p = t;
      return {update(t), x.second};
    }
  }

  template< typename... Args >
  NP merge(NP p, Args... args) {
    return merge(p, merge(args...));
  }

  NP merge(NP l, NP r) {
    if(!l && !r) return nullptr;
    if(!l) return splay(r), r;
    if(!r) return splay(l), l;
    splay(l), splay(r);
    l = splay_back(l);
    l->r = r;
    r->p = l;
    update(l);
    return l;
  }

  tuple< NP, NP, NP > split3(NP t, int a, int b) {
    splay(t);
    auto x = split(t, a);
    auto y = split(x.second, b - a);
    return make_tuple(x.first, y.first, y.second);
  }

  virtual void push(NP t) = 0;

  virtual Node *update(NP t) = 0;

private:

  void rotr(NP t) {
    auto *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) {
    auto *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);
    }
  }

  NP build(int l, int r, const vector< NP > &v) {
    if(l + 1 >= r) return v[l];
    return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));
  }

protected:

  NP build_node(const vector< NP > &v) {
    return build(0, v.size(), v);
  }

  NP insert_node(NP t, int k, NP v) {
    splay(t);
    auto x = split(t, k);
    return merge(x.first, v, x.second);
  }

  NP erase_node(NP t, int k) {
    splay(t);
    auto x = split(t, k);
    auto y = split(x.second, 1);
    delete y.first;
    return merge(x.first, y.second);
  }
};
#line 1 "structure/develop/reversible-splay-tree.hpp"
/**
 * @brief Reversible-Splay-Tree(反転可能Splay木)
 */
template< typename Tp >
struct ReversibleSplayTreeNode {
  using T = Tp;
  ReversibleSplayTreeNode *l, *r, *p;
  T key, sum;
  bool rev;
  size_t sz;

  ReversibleSplayTreeNode() : ReversibleSplayTreeNode(Tp()) {}

  ReversibleSplayTreeNode(const T &key) :
      key(key), sum(key), rev(false), l(nullptr), r(nullptr), p(nullptr), sz(1) {}
};

template< typename Np >
struct ReversibleSplayTree : SplayTreeBase< Np > {
public:
  using Node = Np;
  using T = typename Node::T;
  using F = function< T(T, T) >;
  using S = function< T(T) >;
  using super = SplayTreeBase< Node >;
  using NP = typename super::NP;

  explicit ReversibleSplayTree(const F &f, const S &s, const T &M1) :
      f(f), s(s), M1(M1) {}

  using super::splay;
  using super::split;
  using super::count;
  using super::merge;
  using super::build_node;
  using super::insert_node;

  inline const T &sum(const NP t) { return t ? t->sum : M1; }

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

  T query(NP &t, int a, int b) {
    splay(t);
    auto x = split(t, a);
    auto y = split(x.second, b - a);
    auto ret = sum(y.first);
    t = merge(x.first, y.first, y.second);
    return ret;
  }

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

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

  NP update(NP t) override {
    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 push(NP t) override {
    if(t->rev) {
      if(t->l) toggle(t->l);
      if(t->r) toggle(t->r);
      t->rev = false;
    }
  }

  NP insert(NP t, int k, const T &x) {
    return insert_node(t, k, alloc(x));
  }

  NP set_element(NP t, int k, const T &x) {
    splay(t);
    return imp_set_element(t, k, x);
  }

  pair< NP , NP > split_lower_bound(NP t, const T &key) {
    if(!t) return {nullptr, nullptr};
    push(t);
    if(key <= t->key) {
      auto x = split_lower_bound(t->l, key);
      t->l = x.second;
      t->p = nullptr;
      if(x.second) x.second->p = t;
      return {x.first, update(t)};
    } else {
      auto x = split_lower_bound(t->r, key);
      t->r = x.first;
      t->p = nullptr;
      if(x.first) x.first->p = t;
      return {update(t), x.second};
    }
  }

private:
  const T M1;
  const F f;
  const S s;

  NP imp_set_element(NP t, int k, const T &x) {
    push(t);
    if(k < count(t->l)) {
      return imp_set_element(t->l, k, x);
    } else if(k == count(t->l)) {
      t->key = x;
      splay(t);
      return t;
    } else {
      return imp_set_element(t->r, k - count(t->l) - 1, x);
    }
  }
};

template< typename T >
using RST = ReversibleSplayTree< ReversibleSplayTreeNode< T > >;
#line 1 "structure/develop/lazy-reversible-splay-tree.hpp"
/**
 * @brief Lazy-Reversible-Splay-Tree(遅延伝搬反転可能Splay木)
 */
template< typename Tp, typename Ep >
struct LazyReversibleSplayTreeNode {
  using T = Tp;
  using E = Ep;
  LazyReversibleSplayTreeNode *l, *r, *p;
  T key, sum;
  E lazy;
  bool rev;
  size_t sz;

  LazyReversibleSplayTreeNode() : LazyReversibleSplayTreeNode(Tp()) {}

  LazyReversibleSplayTreeNode(const T &key) :
      LazyReversibleSplayTreeNode(key, E()) {}

  LazyReversibleSplayTreeNode(const T &key, const E &lazy) :
      key(key), sum(key), rev(false), l(nullptr), r(nullptr), p(nullptr), sz(1), lazy(lazy) {}
};

template< typename Np >
struct LazyReversibleSplayTree : ReversibleSplayTree< Np > {
public:
public:
  using Node = Np;
  using T = typename Node::T;
  using E = typename Node::E;
  using super = ReversibleSplayTree< Node >;
  using F = typename super::F;
  using G = function< T(T, E) >;
  using H = function< E(E, E) >;
  using S = typename super::S;
  using NP = typename super::NP;

  explicit LazyReversibleSplayTree(const F &f, const G &g, const H &h, const S &s,
                                   const T &M1, const E &OM0) :
      g(g), h(h), OM0(OM0), super(f, s, M1) {}


  using super::splay;
  using super::split;
  using super::merge;

  NP alloc(const T &x) { return new Node(x, OM0); }

  void push(NP t) override {
    if(t->lazy != OM0) {
      if(t->l) propagate(t->l, t->lazy);
      if(t->r) propagate(t->r, t->lazy);
      t->lazy = OM0;
    }
    super::push(t);
  }

  NP set_propagate(NP& t, int a, int b, const E &pp) {
    splay(t);
    auto x = split(t, a);
    auto y = split(x.second, b - a);
    set_propagate(y.first, pp);
    return t = merge(x.first, y.first, y.second);
  }

  void set_propagate(NP t, const E &pp) {
    splay(t);
    propagate(t, pp);
    push(t);
  }

private:
  const E OM0;
  const G g;
  const H h;

  void propagate(NP t, const E &x) {
    t->lazy = h(t->lazy, x);
    t->key = g(t->key, x);
    t->sum = g(t->sum, x);
  }
};

template< typename T, typename E >
using LRST = LazyReversibleSplayTree< LazyReversibleSplayTreeNode< T, E > >;
#line 1 "structure/develop/link-cut-tree.hpp"
/**
 * @brief Link-Cut-Tree
 */
template< typename STp >
struct LinkCutTree : STp {
  using ST = STp;
  using ST::ST;
  using Node = typename ST::Node;

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

  void link(Node *child, Node *parent) {
    expose(child);
    expose(parent);
    child->p = parent;
    parent->r = child;
    this->update(parent);
  }

  void cut(Node *child) {
    expose(child);
    auto *parent = child->l;
    child->l = nullptr;
    parent->p = nullptr;
    this->update(child);
  }

  void evert(Node *t) {
    expose(t);
    this->toggle(t);
    this->push(t);
  }

  Node *lca(Node *u, Node *v) {
    if(get_root(u) != get_root(v)) return nullptr;
    expose(u);
    return expose(v);
  }

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

  Node *get_root(Node *x) {
    expose(x);
    while(x->l) {
      this->push(x);
      x = x->l;
    }
    return x;
  }
};
#line 9 "test/verify/aoj-2450-3.test.cpp"

int main() {
  int N, Q, S[200000];
  cin >> N >> Q;

  struct Node {
    int64 ans, all, left, right, length;

    Node() : ans(-infll), all(0), left(-infll), right(-infll), length(0) {}

    Node(int64 val, int64 len) : length(len) {
      all = val * len;
      ans = left = right = (val > 0 ? all : val);
    }

    Node operator+(const Node &s) const {
      Node ret;
      ret.length = length + s.length;
      ret.ans = max({ans, s.ans, right + s.left});
      ret.all = all + s.all;
      ret.left = max(left, all + s.left);
      ret.right = max(s.right, right + s.all);
      return ret;
    }
  };
  auto F = [](const Node &a, const Node &b) { return a + b; };
  auto G = [](const Node &a, int64 x) { return Node(x, a.length); };
  auto H = [](int64, int64 y) { return y; };
  auto T = [](Node a) {
    swap(a.left, a.right);
    return a;
  };


  using LCT = LinkCutTree< LRST< Node, int64 > >;
  LCT lct(F, G, H, T, Node(), infll);
  vector< LCT::Node * > vs(N);

  for(int i = 0; i < N; i++) {
    cin >> S[i];
    vs[i] = lct.alloc(Node(S[i], 1));
  }
  for(int i = 0; i < N - 1; i++) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    lct.evert(vs[v]);
    lct.link(vs[v], vs[u]);
  }
  while(Q--) {
    int X, A, B, C;
    cin >> X >> A >> B >> C;
    --A, --B;
    if(X == 1) {
      lct.evert(vs[A]);
      lct.expose(vs[B]);
      lct.set_propagate(vs[B], C);
    } else {
      lct.evert(vs[A]);
      lct.expose(vs[B]);
      cout << vs[B]->sum.ans << "\n";
    }
  }
}

Test cases

Env Name Status Elapsed Memory
g++ testcase_00 :heavy_check_mark: AC 7 ms 4 MB
g++ testcase_01 :heavy_check_mark: AC 7 ms 4 MB
g++ testcase_02 :heavy_check_mark: AC 7 ms 4 MB
g++ testcase_03 :heavy_check_mark: AC 7 ms 4 MB
g++ testcase_04 :heavy_check_mark: AC 8 ms 5 MB
g++ testcase_05 :heavy_check_mark: AC 495 ms 7 MB
g++ testcase_06 :heavy_check_mark: AC 675 ms 19 MB
g++ testcase_07 :heavy_check_mark: AC 782 ms 34 MB
g++ testcase_08 :heavy_check_mark: AC 8 ms 4 MB
g++ testcase_09 :heavy_check_mark: AC 19 ms 5 MB
g++ testcase_10 :heavy_check_mark: AC 142 ms 34 MB
g++ testcase_11 :heavy_check_mark: AC 9 ms 4 MB
g++ testcase_12 :heavy_check_mark: AC 7 ms 4 MB
g++ testcase_13 :heavy_check_mark: AC 8 ms 4 MB
g++ testcase_14 :heavy_check_mark: AC 11 ms 4 MB
g++ testcase_15 :heavy_check_mark: AC 43 ms 5 MB
g++ testcase_16 :heavy_check_mark: AC 236 ms 6 MB
g++ testcase_17 :heavy_check_mark: AC 371 ms 12 MB
g++ testcase_18 :heavy_check_mark: AC 446 ms 19 MB
g++ testcase_19 :heavy_check_mark: AC 581 ms 34 MB
g++ testcase_20 :heavy_check_mark: AC 8 ms 4 MB
g++ testcase_21 :heavy_check_mark: AC 8 ms 4 MB
g++ testcase_22 :heavy_check_mark: AC 20 ms 5 MB
g++ testcase_23 :heavy_check_mark: AC 126 ms 6 MB
g++ testcase_24 :heavy_check_mark: AC 446 ms 16 MB
g++ testcase_25 :heavy_check_mark: AC 438 ms 34 MB
g++ testcase_26 :heavy_check_mark: AC 8 ms 4 MB
g++ testcase_27 :heavy_check_mark: AC 321 ms 7 MB
g++ testcase_28 :heavy_check_mark: AC 423 ms 19 MB
g++ testcase_29 :heavy_check_mark: AC 579 ms 34 MB
g++ testcase_30 :heavy_check_mark: AC 9 ms 4 MB
g++ testcase_31 :heavy_check_mark: AC 11 ms 4 MB
g++ testcase_32 :heavy_check_mark: AC 61 ms 5 MB
g++ testcase_33 :heavy_check_mark: AC 294 ms 9 MB
g++ testcase_34 :heavy_check_mark: AC 393 ms 19 MB
g++ testcase_35 :heavy_check_mark: AC 473 ms 32 MB
g++ testcase_36 :heavy_check_mark: AC 487 ms 33 MB
g++ testcase_37 :heavy_check_mark: AC 487 ms 34 MB
g++ testcase_38 :heavy_check_mark: AC 490 ms 34 MB
clang++ testcase_00 :heavy_check_mark: AC 7 ms 4 MB
clang++ testcase_01 :heavy_check_mark: AC 6 ms 4 MB
clang++ testcase_02 :heavy_check_mark: AC 7 ms 4 MB
clang++ testcase_03 :heavy_check_mark: AC 6 ms 4 MB
clang++ testcase_04 :heavy_check_mark: AC 7 ms 4 MB
clang++ testcase_05 :heavy_check_mark: AC 462 ms 7 MB
clang++ testcase_06 :heavy_check_mark: AC 604 ms 19 MB
clang++ testcase_07 :heavy_check_mark: AC 782 ms 34 MB
clang++ testcase_08 :heavy_check_mark: AC 8 ms 4 MB
clang++ testcase_09 :heavy_check_mark: AC 19 ms 4 MB
clang++ testcase_10 :heavy_check_mark: AC 146 ms 34 MB
clang++ testcase_11 :heavy_check_mark: AC 8 ms 4 MB
clang++ testcase_12 :heavy_check_mark: AC 7 ms 4 MB
clang++ testcase_13 :heavy_check_mark: AC 7 ms 4 MB
clang++ testcase_14 :heavy_check_mark: AC 10 ms 4 MB
clang++ testcase_15 :heavy_check_mark: AC 40 ms 4 MB
clang++ testcase_16 :heavy_check_mark: AC 226 ms 5 MB
clang++ testcase_17 :heavy_check_mark: AC 358 ms 11 MB
clang++ testcase_18 :heavy_check_mark: AC 435 ms 19 MB
clang++ testcase_19 :heavy_check_mark: AC 551 ms 34 MB
clang++ testcase_20 :heavy_check_mark: AC 8 ms 4 MB
clang++ testcase_21 :heavy_check_mark: AC 7 ms 4 MB
clang++ testcase_22 :heavy_check_mark: AC 19 ms 4 MB
clang++ testcase_23 :heavy_check_mark: AC 121 ms 5 MB
clang++ testcase_24 :heavy_check_mark: AC 461 ms 15 MB
clang++ testcase_25 :heavy_check_mark: AC 423 ms 34 MB
clang++ testcase_26 :heavy_check_mark: AC 8 ms 4 MB
clang++ testcase_27 :heavy_check_mark: AC 316 ms 7 MB
clang++ testcase_28 :heavy_check_mark: AC 435 ms 19 MB
clang++ testcase_29 :heavy_check_mark: AC 562 ms 34 MB
clang++ testcase_30 :heavy_check_mark: AC 8 ms 4 MB
clang++ testcase_31 :heavy_check_mark: AC 10 ms 4 MB
clang++ testcase_32 :heavy_check_mark: AC 58 ms 4 MB
clang++ testcase_33 :heavy_check_mark: AC 295 ms 9 MB
clang++ testcase_34 :heavy_check_mark: AC 366 ms 19 MB
clang++ testcase_35 :heavy_check_mark: AC 475 ms 32 MB
clang++ testcase_36 :heavy_check_mark: AC 473 ms 33 MB
clang++ testcase_37 :heavy_check_mark: AC 493 ms 34 MB
clang++ testcase_38 :heavy_check_mark: AC 481 ms 34 MB
Back to top page