#415006 (C++17) No.772 Dynamic Distance Sum

提出ソース

結果

問題	No.772 Dynamic Distance Sum
ユーザー	ei1333333
提出日時	2020-01-08 03:08:04
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	806 ms / 5,000 ms
コード長	14,267 bytes
コンパイル時間	2,715 ms
コンパイル使用メモリ	220,780 KB
実行使用メモリ	72,064 KB
最終ジャッジ日時	2024-11-23 02:08:58
合計ジャッジ時間	18,507 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	46 ms 69,120 KB
testcase_01	AC	46 ms 68,992 KB
testcase_02	AC	46 ms 69,120 KB
testcase_03	AC	47 ms 69,120 KB
testcase_04	AC	49 ms 69,248 KB
testcase_05	AC	47 ms 69,120 KB
testcase_06	AC	49 ms 69,120 KB
testcase_07	AC	47 ms 69,120 KB
testcase_08	AC	48 ms 68,992 KB
testcase_09	AC	50 ms 69,248 KB
testcase_10	AC	50 ms 69,248 KB
testcase_11	AC	47 ms 69,120 KB
testcase_12	AC	806 ms 71,808 KB
testcase_13	AC	722 ms 71,808 KB
testcase_14	AC	726 ms 71,808 KB
testcase_15	AC	654 ms 71,808 KB
testcase_16	AC	748 ms 71,808 KB
testcase_17	AC	775 ms 71,808 KB
testcase_18	AC	532 ms 71,808 KB
testcase_19	AC	726 ms 71,808 KB
testcase_20	AC	453 ms 71,808 KB
testcase_21	AC	790 ms 72,064 KB
testcase_22	AC	690 ms 72,064 KB
testcase_23	AC	781 ms 72,064 KB
testcase_24	AC	687 ms 72,064 KB
testcase_25	AC	758 ms 72,064 KB
testcase_26	AC	764 ms 72,064 KB
testcase_27	AC	684 ms 72,064 KB
testcase_28	AC	707 ms 71,936 KB
testcase_29	AC	471 ms 72,064 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 998244353;

const int64 infll = (1LL << 60) - 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 {
  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)};
}

template< class T, size_t V >
struct ArrayPool {
  array< T, V > pool;
  array< T *, V > stock;
  int ptr;

  ArrayPool() { clear(); }

  inline T *alloc() {
    return stock[--ptr];
  }

  inline void free(T *t) {
    stock[ptr++] = t;
  }

  void clear() {
    ptr = (int) pool.size();
    for(int i = 0; i < pool.size(); i++) stock[i] = &pool[i];
  }
};

template< typename key_t, size_t V >
struct SplayTree {

  const key_t e;

  SplayTree(const key_t &e) : pool(), e(e) {}

  struct Node {
    Node *l, *r, *p;
    key_t key, sum;

    Node() = default;

    Node(const key_t &k) : key(k), sum(k), l(nullptr), r(nullptr), p(nullptr) {}
  };

  ArrayPool< Node, V > pool;


  void rotr(Node *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(Node *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);
    }
  }

  inline key_t sum(const Node *t) const {
    return t ? t->sum : e;
  }

  void update(Node *t) {
    t->sum = t->key;
    if(t->l) t->sum = max(t->sum, t->l->sum);
    if(t->r) t->sum = max(t->sum, t->r->sum);
  }

  Node *get_left(Node *t) const {
    while(t->l) t = t->l;
    return t;
  }

  Node *get_right(Node *t) const {
    while(t->r) t = t->r;
    return t;
  }

  inline Node *alloc(const key_t &v) {
    return &(*pool.alloc() = Node(v));
  }

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

  Node *push_back(Node *t, const key_t &v) {
    if(!t) {
      t = alloc(v);
      return t;
    } else {
      Node *cur = get_right(t), *z = alloc(v);
      z->p = cur;
      cur->r = z;
      update(cur);
      splay(z);
      return z;
    }
  }

  Node *erase(Node *t) {
    splay(t);
    Node *x = t->l, *y = t->r;
    pool.free(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;
      update(t);
    }
    return t;
  }
};


template< typename SUM, typename KEY, size_t V >
struct LinkCutTreeSubtree {

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

    typename SplayTree< pair< int64_t, Node * >, V >::Node *light, *belong;
    KEY key;
    SUM sum;

    bool rev;

    Node() = default;

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

    Node(const KEY &key, const SUM &sum) :
        key(key), sum(sum), rev(false), belong(nullptr),
        l(nullptr), r(nullptr), p(nullptr), light(nullptr) {}
  };

  using ST = SplayTree< pair< int64_t, Node * >, V >;

  ST st;
  const SUM ident;
  ArrayPool< Node, V > pool;

  LinkCutTreeSubtree(const SUM &ident) : ident(ident), st(make_pair(-infll, nullptr)), pool() {}

  Node *alloc(const KEY &key) {
    auto ret = &(*pool.alloc() = Node(key, ident));
    update(ret);
    return ret;
  }

  Node *set_key(Node *t, const KEY &key) {
    expose(t);
    t->key = key;
    update(t);
    return t;
  }

  void toggle(Node *t) {
    swap(t->l, t->r);
    t->sum.toggle();
    t->rev ^= true;
  }

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


  void update(Node *t) {
    t->sum.merge(t->key, t->l ? t->l->sum : ident, t->r ? t->r->sum : ident);
  }

  void rotr(Node *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(Node *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);
    }
  }


  void splay(Node *t) {
    push(t);

    Node *rot = t;
    while(!rot->is_root()) rot = rot->p;
    t->belong = rot->belong;
    if(t != rot) rot->belong = nullptr;

    while(!t->is_root()) {
      auto *q = t->p;
      if(q->is_root()) {
        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);
        }
      }
    }

  }


  Node *expose(Node *t) {
    Node *rp = nullptr;
    for(auto *cur = t; cur; cur = cur->p) {
      splay(cur);
      if(cur->r) {
        cur->light = st.push_back(cur->light, {cur->r->sum.sz, cur->r});
        cur->r->belong = cur->light;
        cur->sum.add(cur->r->sum);
      }
      cur->r = rp;
      if(cur->r) {
        cur->light = st.erase(cur->r->belong);
        cur->sum.erase(cur->r->sum);
      }
      update(cur);
      rp = cur;
    }
    splay(t);
    return rp;
  }

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

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

  void evert(Node *t) {
    expose(t);
    toggle(t);
    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) {
      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) {
      push(x);
      x = x->l;
    }
    return x;
  }
};

struct Scanner {
  FILE *fp = nullptr;
  char line[(1 << 15) + 1];
  size_t st = 0, ed = 0;

  void reread() {
    memmove(line, line + st, ed - st);
    ed -= st;
    st = 0;
    ed += fread(line + ed, 1, (1 << 15) - ed, fp);
    line[ed] = '\0';
  }

  bool succ() {
    while(true) {
      if(st == ed) {
        reread();
        if(st == ed) return false;
      }
      while(st != ed && isspace(line[st])) st++;
      if(st != ed) break;
    }
    if(ed - st <= 50) reread();
    return true;
  }

  template< class T, enable_if_t< is_same< T, string >::value, int > = 0 >
  bool read_single(T &ref) {
    if(!succ()) return false;
    while(true) {
      size_t sz = 0;
      while(st + sz < ed && !isspace(line[st + sz])) sz++;
      ref.append(line + st, sz);
      st += sz;
      if(!sz || st != ed) break;
      reread();
    }
    return true;
  }

  template< class T, enable_if_t< is_integral< T >::value, int > = 0 >
  bool read_single(T &ref) {
    if(!succ()) return false;
    bool neg = false;
    if(line[st] == '-') {
      neg = true;
      st++;
    }
    ref = T(0);
    while(isdigit(line[st])) {
      ref = 10 * ref + (line[st++] - '0');
    }
    if(neg) ref = -ref;
    return true;
  }

  template< class T >
  bool read_single(vector< T > &ref) {
    for(auto &d : ref) {
      if(!read_single(d)) return false;
    }
    return true;
  }

  void read() {}

  template< class H, class... T >
  void read(H &h, T &... t) {
    bool f = read_single(h);
    assert(f);
    read(t...);
  }

  Scanner(FILE *_fp) : fp(_fp) {}
};

struct Printer {
public:
  template< bool F = false >
  void write() {}

  template< bool F = false, class H, class... T >
  void write(const H &h, const T &... t) {
    if(F) write_single(' ');
    write_single(h);
    write< true >(t...);
  }

  template< class... T >
  void writeln(const T &... t) {
    write(t...);
    write_single('\n');
  }

  Printer(FILE *_fp) : fp(_fp) {}

  ~Printer() { flush(); }

private:
  static constexpr size_t SIZE = 1 << 15;
  FILE *fp;
  char line[SIZE], small[50];
  size_t pos = 0;

  void flush() {
    fwrite(line, 1, pos, fp);
    pos = 0;
  }

  void write_single(const char &val) {
    if(pos == SIZE) flush();
    line[pos++] = val;
  }

  template< class T, enable_if_t< is_integral< T >::value, int > = 0 >
  void write_single(T val) {
    if(pos > (1 << 15) - 50) flush();
    if(val == 0) {
      write_single('0');
      return;
    }
    if(val < 0) {
      write_single('-');
      val = -val;  // todo min
    }
    size_t len = 0;
    while(val) {
      small[len++] = char('0' + (val % 10));
      val /= 10;
    }
    reverse(small, small + len);
    memcpy(line + pos, small, len);
    pos += len;
  }

  void write_single(const string &s) {
    for(char c : s) write_single(c);
  }

  void write_single(const char *s) {
    size_t len = strlen(s);
    for(size_t i = 0; i < len; i++) write_single(s[i]);
  }

  template< class T >
  void write_single(const vector< T > &val) {
    auto n = val.size();
    for(size_t i = 0; i < n; i++) {
      if(i) write_single(' ');
      write_single(val[i]);
    }
  }
};


int main() {
  using Key = pair< bool, int >;

  struct Sum {
    int64 all, pdist, cdist, mdist;
    int sz, msz;

    Sum() : all(0), pdist(0), cdist(0), sz(0), mdist(0), msz(0) {}

    void toggle() {
      swap(pdist, cdist);
    }

    void merge(const Key &key, const Sum &parent, const Sum &child) {
      if(key.first) {
        all = parent.all + key.second + child.all;
        pdist = parent.pdist + (child.all + key.second) * (parent.sz + msz) + child.pdist + mdist;
        cdist = child.cdist + (parent.all + key.second) * (child.sz + msz) + parent.cdist + mdist;
        sz = parent.sz + child.sz + msz;
      } else {
        all = parent.all + child.all;
        pdist = parent.pdist + child.all * (parent.sz + msz + key.second) + child.pdist + mdist;
        cdist = child.cdist + parent.all * (child.sz + msz + key.second) + parent.cdist + mdist;
        sz = parent.sz + key.second + child.sz + msz;
      }
    }

    void add(const Sum &chsum) {
      mdist += chsum.cdist;
      msz += chsum.sz;
    }

    void erase(const Sum &chsum) {
      mdist -= chsum.cdist;
      msz -= chsum.sz;
    }

  } e;

  Scanner in(stdin);
  Printer out(stdout);

  using LCT = LinkCutTreeSubtree< Sum, Key, 400000 >;
  int N, Q;
  in.read(N, Q);
  LCT lct(e);
  vector< LCT::Node * > vv(N), ee(Q);

  auto search = MFP([&](auto search, LCT::Node *t, int half, int pre) -> LCT::Node * {
    lct.push(t);
    int r = t->r ? t->r->sum.sz : 0;
    if(t->r && half <= pre + r) return search(t->r, half, pre);

    if(t->light) {
      lct.st.splay(t->light);
      auto ret = t->light->sum;
      if(half <= ret.first) {
        lct.splay(ret.second);
        return search(ret.second, half, 0);
      }
    }

    int cur = (!t->key.first && t->key.second) + t->sum.msz + r + pre;
    if(half <= cur) return t;

    return search(t->l, half, cur);
  });


  int ptr = 0;
  for(int i = 0; i < N; i++) {
    vv[i] = lct.alloc(Key(false, 1));
  }
  int64 S = 0;

  for(int i = 0; i < Q; i++) {
    int64 T, A, B, C;
    in.read(T, A);
    A = (A - 1 + S) % N;
    if(T == 1) {
      in.read(B, C);
      B = (B - 1 + S) % N;
      ee[ptr] = lct.alloc(Key(true, C));
      lct.evert(vv[B]);
      lct.link(vv[B], ee[ptr]);
      lct.link(ee[ptr], vv[A]);
    } else if(T == 2) {
      in.read(B);
      B = (B - 1 + S) % N;
      lct.evert(vv[A]);
      lct.cut(vv[B]);
    } else {
      lct.set_key(vv[A], Key(false, 1 - vv[A]->key.second));
      if(vv[A]->sum.sz <= 1) {
        out.writeln(0);
      } else {
        auto root = search(vv[A], (vv[A]->sum.sz - 1) / 2 + 1, 0);
        lct.evert(root);
        S += root->sum.cdist;
        S %= N;
        out.writeln(root->sum.cdist);
      }
    }
  }
}

yukicoder

結果

テストケース

ソースコード