#724244 (C++17) No.1787 Do Use Dynamic Tree

提出ソース

結果

問題	No.1787 Do Use Dynamic Tree
ユーザー	beet
提出日時	2021-12-15 16:34:01
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	5,249 ms / 10,000 ms
コード長	12,563 bytes
コンパイル時間	3,036 ms
コンパイル使用メモリ	220,160 KB
実行使用メモリ	115,424 KB
最終ジャッジ日時	2024-07-23 20:30:29
合計ジャッジ時間	74,313 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	32 ms 103,524 KB
testcase_01	AC	31 ms 103,524 KB
testcase_02	AC	32 ms 103,424 KB
testcase_03	AC	31 ms 103,424 KB
testcase_04	AC	32 ms 103,520 KB
testcase_05	AC	32 ms 103,524 KB
testcase_06	AC	34 ms 103,520 KB
testcase_07	AC	32 ms 103,524 KB
testcase_08	AC	33 ms 103,396 KB
testcase_09	AC	33 ms 103,400 KB
testcase_10	AC	32 ms 103,656 KB
testcase_11	AC	32 ms 103,524 KB
testcase_12	AC	42 ms 103,524 KB
testcase_13	AC	42 ms 103,524 KB
testcase_14	AC	46 ms 103,652 KB
testcase_15	AC	42 ms 103,400 KB
testcase_16	AC	44 ms 103,652 KB
testcase_17	AC	45 ms 103,524 KB
testcase_18	AC	44 ms 103,392 KB
testcase_19	AC	45 ms 103,392 KB
testcase_20	AC	41 ms 103,524 KB
testcase_21	AC	46 ms 103,520 KB
testcase_22	AC	3,838 ms 104,932 KB
testcase_23	AC	2,888 ms 105,572 KB
testcase_24	AC	3,166 ms 104,676 KB
testcase_25	AC	4,900 ms 105,696 KB
testcase_26	AC	4,787 ms 105,572 KB
testcase_27	AC	5,013 ms 105,568 KB
testcase_28	AC	3,258 ms 114,920 KB
testcase_29	AC	3,258 ms 115,424 KB
testcase_30	AC	3,242 ms 114,400 KB
testcase_31	AC	3,284 ms 112,232 KB
testcase_32	AC	4,101 ms 105,952 KB
testcase_33	AC	5,249 ms 105,700 KB
testcase_34	AC	1,820 ms 109,416 KB
testcase_35	AC	3,563 ms 105,956 KB
testcase_36	AC	4,948 ms 105,568 KB
testcase_37	AC	3,488 ms 107,492 KB
testcase_38	AC	3,484 ms 109,796 KB
testcase_39	AC	3,537 ms 111,716 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}


template<typename Vertex, typename Cluster, size_t N>
struct TopTree{
  enum Type { Compress, Rake, Edge };
  struct Node{
    Vertex* vs[2];
    Cluster dat;
    Node* p;
    Node* q;
    Node* ch[2];
    bool rev,guard;
    Type type;
    Node(){p=q=nullptr;rev=guard=false;}
  };

  inline static array<Vertex, 2*N> pool_vertex;
  inline static size_t ptr_vertex = 0;

  inline static array<Node, 4*N> pool_node;
  inline static size_t ptr_node = 0;

  Cluster id;

  template<typename ...Args>
  inline Vertex* create(Args ...args){
    auto t=&pool_vertex[ptr_vertex++];
    auto dummy=&pool_vertex[ptr_vertex++];
    *t=Vertex(forward<Args>(args)...);
    link(t,id,dummy);
    return t;
  }

  Node* recycle=nullptr;
  inline void dispose_node(Node* t){
    t->p=recycle;
    recycle=t;
  }

  inline Node* get_new_node(){
    if(recycle) return new(exchange(recycle,recycle->p)) Node;
    return &(pool_node[ptr_node++]);
  }

  inline Node* edge(Vertex* u,Cluster w,Vertex* v){
    auto t=get_new_node();
    t->vs[0]=u;t->vs[1]=v;t->dat=w;
    t->type=Type::Edge;
    return pushup(t);
  }

  inline Node* compress(Node* l,Node* r){
    auto t=get_new_node();
    t->ch[0]=l;t->ch[1]=r;
    t->type=Type::Compress;
    return pushup(t);
  }

  inline Node* rake(Node* l,Node* r){
    auto t=get_new_node();
    t->ch[0]=l;t->ch[1]=r;
    t->type=Type::Rake;
    return pushup(t);
  }

  int parent_dir(Node* t){
    Node* p=t->p;
    if(!p) return -1;
    if(p->guard) return -1;
    if(p->ch[0]==t) return 0;
    if(p->ch[1]==t) return 1;
    return -1;
  }

  int parent_dir_ignore_guard(Node* t){
    Node* p=t->p;
    if(!p) return -1;
    if(p->ch[0]==t) return 0;
    if(p->ch[1]==t) return 1;
    return -1;
  }

  inline Node* pushup(Node* const t){
    Node* const l=t->ch[0];
    Node* const r=t->ch[1];

    if(t->type==Type::Compress){
      assert(l->vs[1]==r->vs[0]);
      t->vs[0]=l->vs[0];
      t->vs[1]=r->vs[1];

      Cluster lf=l->dat;
      if(t->q){
        assert(l->vs[1]==t->q->vs[1]);
        lf=Cluster::rake(l->dat,t->q->dat);
      }
      t->dat=Cluster::compress(lf,r->vs[0],r->dat);

      l->vs[1]->handle=t;
    }

    if(t->type==Type::Rake){
      propagate(t);
      assert(l->vs[1]==r->vs[1]);
      t->vs[0]=l->vs[0];
      t->vs[1]=l->vs[1];
      t->dat=Cluster::rake(l->dat,r->dat);
    }else{
      if(!t->p){
        t->vs[0]->handle=t;
        t->vs[1]->handle=t;
      }else if(t->p->type==Type::Compress){
        if(parent_dir(t)==-1)
          t->vs[0]->handle=t;
      }else if(t->p->type==Type::Rake){
        t->vs[0]->handle=t;
      }
    }
    return t;
  }

  inline void toggle(Node* t){
    if(t->type==Type::Edge){
      swap(t->vs[0],t->vs[1]);
      t->dat.toggle();
    }else if(t->type==Type::Compress){
      swap(t->vs[0],t->vs[1]);
      t->dat.toggle();
      t->rev^=true;
    }else if(t->type==Type::Rake){
    }else abort();
  }

  inline void propagate(Node* t){
    if(t->type==Type::Compress){
      if(t->rev){
        assert(t->ch[0] and t->ch[1]);
        swap(t->ch[0],t->ch[1]);
        toggle(t->ch[0]);
        toggle(t->ch[1]);
        t->rev=false;
      }
    }
  }

  void set_toggle(Node* v){
    toggle(v);propagate(v);
  }

  void pushdown(Node* t){
    if(!t) return;
    pushdown(t->p);
    propagate(t);
  }

  void rotate(Node* t,Node* x,size_t dir){
    Node* y=x->p;
    int par=parent_dir_ignore_guard(x);
    propagate(t->ch[dir]);
    x->ch[dir^1]=t->ch[dir];
    t->ch[dir]->p=x;
    t->ch[dir]=x;
    x->p=t;
    t->p=y;
    if(~par) y->ch[par]=t;
    else if(y and y->type==Type::Compress) y->q=t;
    pushup(x);pushup(t);
    if(y and !y->guard) pushup(y);
  }

  void splay(Node* t){
    assert(t->type!=Type::Edge);
    propagate(t);

    while(~parent_dir(t)){
      Node* q=t->p;
      if(q->type!=t->type) break;
      if(~parent_dir(q) and q->p and q->p->type==q->type){
        Node* r=q->p;
        if(r->p) propagate(r->p);
        propagate(r);propagate(q);propagate(t);
        int qt_dir=parent_dir(t);
        int rq_dir=parent_dir(q);
        if(rq_dir==qt_dir){
          rotate(q,r,rq_dir^1);
          rotate(t,q,qt_dir^1);
        }else{
          rotate(t,q,qt_dir^1);
          rotate(t,r,rq_dir^1);
        }
      }else{
        if(q->p) propagate(q->p);
        propagate(q);propagate(t);
        int qt_dir=parent_dir(t);
        rotate(t,q,qt_dir^1);
      }
    }
  }

  Node* expose(Node* t){
    pushdown(t);
    while(true){
      assert(t->type!=Type::Rake);
      if(t->type==Type::Compress) splay(t);
      Node* n=nullptr;
      {
        Node* p=t->p;
        if(!p) break;
        if(p->type==Type::Rake){
          propagate(p);
          splay(p);
          n=p->p;
        }
        if(p->type==Type::Compress){
          propagate(p);
          if(p->guard and ~parent_dir_ignore_guard(t)) break;
          n=p;
        }
      }
      splay(n);
      int dir=parent_dir_ignore_guard(n);
      if(dir==-1 or n->p->type==Type::Rake) dir=0;

      Node* const c=n->ch[dir];
      if(dir==1){
        set_toggle(c);
        set_toggle(t);
      }
      int n_dir=parent_dir(t);
      if(~n_dir){
        Node* const r=t->p;
        propagate(c);
        propagate(r);
        r->ch[n_dir]=c;
        c->p=r;
        n->ch[dir]=t;
        t->p=n;
        pushup(c);pushup(r);
        pushup(t);pushup(n);
        splay(r);
      }else{
        propagate(c);
        n->q=c;
        c->p=n;
        n->ch[dir]=t;
        t->p=n;
        pushup(c);pushup(t);pushup(n);
      }
      if(t->type==Type::Edge) t=n;
    }
    return t;
  }

  Node* expose(Vertex* v){
    return expose((Node*)(v->handle));
  }

  void soft_expose(Vertex* u,Vertex* v){
    pushdown((Node*)u->handle);
    pushdown((Node*)v->handle);
    Node* rt=expose(u);

    if(u->handle==v->handle){
      if(rt->vs[1]==u or rt->vs[0]==v)
        set_toggle(rt);
      return;
    }

    rt->guard=true;
    Node* soft=expose(v);
    rt->guard=false;

    pushup(rt);
    if(parent_dir(soft)==0) set_toggle(rt);
  }

  void bring(Node* rt){
    Node* rk=rt->q;
    if(!rk){
      Node* ll=rt->ch[0];
      dispose_node(ll->p);
      ll->p=nullptr;
      pushup(ll);
    }else if(rk->type==Type::Compress or rk->type==Type::Edge){
      Node* nr=rk;
      set_toggle(nr);
      rt->ch[1]=nr;
      nr->p=rt;
      rt->q=nullptr;

      pushup(nr);pushup(rt);
    }else if(rk->type==Type::Rake){
      propagate(rk);
      while(rk->ch[1]->type==Type::Rake){
        propagate(rk->ch[1]);
        rk=rk->ch[1];
      }
      pushdown(rk);

      rt->guard=true;
      splay(rk);
      rt->guard=false;

      Node* ll=rk->ch[0];
      Node* rr=rk->ch[1];
      propagate(ll);
      set_toggle(rr);

      rt->ch[1]=rr;
      rr->p=rt;

      rt->q=ll;
      ll->p=rt;

      dispose_node(rk);
      pushup(ll);pushup(rr);pushup(rt);
    }
  }

  Node* link(Vertex* u,Cluster w,Vertex* v){
    if(!u->handle and !v->handle) return edge(u,w,v);

    Node* nnu=(Node*)u->handle;
    Node* nnv=(Node*)v->handle;
    Node* ee=edge(u,w,v);
    Node* ll=nullptr;

    assert(nnv);
    Node* vv=expose(nnv);
    propagate(vv);
    if(vv->vs[1]==v) set_toggle(vv);
    if(vv->vs[0]==v){
      Node* nv=compress(ee,vv);
      ee->p=nv;
      pushup(ee);
      vv->p=nv;
      pushup(vv);pushup(nv);
      ll=nv;
    }else{
      Node* nv=vv;
      Node* ch=nv->ch[0];
      propagate(ch);
      nv->ch[0]=ee;
      ee->p=nv;
      pushup(ee);

      Node* bt=nv->q;
      Node* rk=nullptr;
      if(bt){
        propagate(bt);
        rk=rake(bt,ch);
        bt->p=rk;
        ch->p=rk;
        pushup(bt);pushup(ch);
      }else{
        rk=ch;
      }
      nv->q=rk;
      rk->p=nv;
      pushup(rk);pushup(nv);
      ll=nv;
    }

    assert(nnu);
    Node* uu=expose(nnu);
    propagate(uu);
    if(uu->vs[0]==u) set_toggle(uu);
    if(uu->vs[1]==u){
      Node* tp=compress(uu,ll);
      uu->p=tp;
      ll->p=tp;
      pushup(uu);pushup(ll);pushup(tp);
    }else{
      Node* nu=uu;
      Node* ch=nu->ch[1];
      toggle(ch);
      propagate(ch);

      nu->ch[1]=ll;
      ll->p=nu;
      pushup(ll);

      Node* al=nu->q;
      Node* rk=nullptr;
      if(al){
        propagate(al);
        rk=rake(al,ch);
        al->p=rk;
        ch->p=rk;
        pushup(al);pushup(ch);
      }else{
        rk=ch;
      }
      nu->q=rk;
      rk->p=nu;
      pushup(rk);pushup(nu);
    }
    return ee;
  }

  void cut(Vertex* u,Vertex *v){
    soft_expose(u,v);
    Node* rt=(Node*)u->handle;
    propagate(rt);
    Node* rr=rt->ch[1];
    rr->p=nullptr;
    set_toggle(rr);
    assert(rr->ch[1]->type==Type::Edge);
    dispose_node(rr->ch[1]);
    bring(rr);bring(rt);
  }

  Node* path(Vertex* u,Vertex* v){
    assert(u!=v);
    soft_expose(u,v);
    Node* rt=(Node*)u->handle;
    propagate(rt);
    propagate(rt->ch[1]);
    return rt->ch[1]->ch[0];
  }

  void set_vertex(Vertex* u,Vertex v){
    auto t=expose(u);
    *u=v;
    pushup(t);
  }

  void set_edge(Vertex* u,Vertex* v,const Cluster &w){
    auto t=path(u,v);
    assert(t->type==Type::Edge);
    t->dat=w;
    while(t) pushup(t),t=t->p;
  }

  Cluster get_path(Vertex* u,Vertex* v){
    return path(u,v)->dat;
  }

  Cluster get_subtree(Vertex* v){
    return expose(v)->dat;
  }

  // subtree of v when p is root
  Cluster get_subtree(Vertex* p,Vertex* v){
    Node* t=path(p,v);
    Cluster res=t->p->ch[1]->dat;
    res.toggle();
    Node* rk=t->p->q;
    if(t->p->q){
      assert(rk->vs[1]==t->p->ch[1]->vs[0]);
      res=Cluster::rake(res,rk->dat);
    }
    return res;
  }
};

struct Vertex{
  int index,value;
  void* handle;
  Vertex(int index_=-1,int value_=-1):
    index(index_),value(value_),handle(nullptr){}
};

namespace Data{
  using P = pair<int, int>;
  struct Node{
    // head: value, tail: index
    int head,tail;
    // ushi: value
    int ushi;
    // head -> ushi
    bool connected;
    Node(){head=tail=ushi=-1;connected=false;}
    Node(int head_,int tail_,int ushi_,bool connected_):
      head(head_),tail(tail_),ushi(ushi_),connected(connected_){
      if(!connected) assert(ushi==-1);
    }
  };
  Node rake(const Node& lhs,const Node& rhs){
    return lhs.head>rhs.head?lhs:rhs;
  }
  Node compress(Vertex *v,const Node& lhs,const Node& mid,const Node& rhs){
    int index=v->index,value=v->value;

    int use_v=rhs.head<0 or (rhs.connected and value>rhs.ushi);
    int new_head=rhs.head<0?value:rhs.head;
    bool new_connected=lhs.head<0 or (lhs.head>mid.head and lhs.connected);

    // not use v
    if(!use_v) return Node(new_head,rhs.tail,-1,false);

    // use v
    if(lhs.head<0){
      if(mid.head<0) return Node(new_head,index,-1,new_connected);
      return Node(new_head,mid.tail,mid.head,new_connected);
    }

    if(lhs.head>mid.head)
      return Node(new_head,lhs.tail,lhs.ushi,new_connected);

    return Node(new_head,mid.tail,-1,new_connected);
  }
}

struct Cluster{
  Data::Node pre,suf,mid,ans;
  Cluster(){}
  void toggle(){swap(pre,suf);}
  static Cluster compress(const Cluster& x,Vertex *v,const Cluster& y){
    Cluster res;
    res.pre=Data::compress(v,x.pre,x.mid,y.pre);
    res.suf=Data::compress(v,y.suf,x.mid,x.suf);
    res.ans=Data::rake(Data::rake(x.pre,x.mid),y.suf);
    return res;
  }
  static Cluster rake(const Cluster& x,const Cluster& y){
    Cluster res;
    res.pre=x.pre;
    res.suf=x.suf;
    res.mid=Data::rake(x.mid,Data::rake(y.pre,y.mid));
    return res;
  }
};

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  int n;
  cin>>n;

  const size_t N = 2e5;
  TopTree<Vertex, Cluster, N> G;

  vector<int> value(n);
  vector<Vertex*> vs(n);
  for(int i=0;i<n;i++)
    vs[i]=G.create(i,value[i]=i);

  for(int i=1;i<n;i++){
    int u,v;
    cin>>u>>v;
    u--;v--;
    G.link(vs[u],Cluster(),vs[v]);
  }

  int q;
  cin>>q;

  int x=0;
  for(int i=0;i<q;i++){
    int u,v;
    cin>>u>>v;
    u--;v--;
    u=(u+x)%n;v=(v+x)%n;
    swap(value[u],value[v]);
    G.set_vertex(vs[u],Vertex(u,value[u]));
    G.set_vertex(vs[v],Vertex(v,value[v]));
    auto res=G.get_subtree(vs[u]);
    cout<<(x=res.ans.tail+1)<<newl;
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード