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-2.test.cpp

Depends on

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2450"

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

#include "../../structure/lct/link-cut-tree-lazy-path.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;
  };


  auto lct = get_link_cut_tree_lazy_path< Node >(F, G, H, T, infll);
  vector< decltype(lct)::NP > 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.set_propagate(vs[A], vs[B], C);
    } else {
      cout << lct.query(vs[A], vs[B]).ans << "\n";
    }
  }
}
#line 1 "test/verify/aoj-2450-2.test.cpp"
#define 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 int mod = 1e9 + 7;

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-2.test.cpp"

#line 1 "structure/lct/link-cut-tree-lazy-path.hpp"
/**
 * @brief Link Cut Tree Lazy Path
 * @docs docs/link-cut-tree-lazy-path.md
 */
template< typename T, typename E, typename F, typename G, typename H, typename S >
struct LinkCutTreeLazyPath {

private:
  F f;
  G g;
  H h;
  S s;
  E e0;

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

    explicit Node(const T &v, const E &e) : key(v), sum(v), lazy(e), 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 propagate(NP t, const E &e) {
    t->lazy = h(t->lazy, e);
    t->key = g(t->key, e);
    t->sum = g(t->sum, e);
  }

  void push(NP t) {
    if(t->lazy != e0) {
      if(t->l) propagate(t->l, t->lazy);
      if(t->r) propagate(t->r, t->lazy);
      t->lazy = e0;
    }
    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:
  LinkCutTreeLazyPath(const F &f, const G &g, const H &h, const S &s, const E &e0) :
      f(f), g(g), h(h), s(s), e0(e0) {}

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

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

  void set_propagate(NP t, const E &e) {
    expose(t);
    propagate(t, e);
    push(t);
  }

  void set_propagate(NP u, NP v, const E &e) {
    evert(u);
    set_propagate(v, e);
  }
};

template< typename T, typename E, typename F, typename G, typename H, typename S >
LinkCutTreeLazyPath< T, E, F, G, H, S > get_link_cut_tree_lazy_path(const F &f, const G &g, const H &h, const S &s, const E &e0) {
  return {f, g, h, s, e0};
}
#line 6 "test/verify/aoj-2450-2.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;
  };


  auto lct = get_link_cut_tree_lazy_path< Node >(F, G, H, T, infll);
  vector< decltype(lct)::NP > 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.set_propagate(vs[A], vs[B], C);
    } else {
      cout << lct.query(vs[A], vs[B]).ans << "\n";
    }
  }
}
Back to top page