bzoj4444 国旗计划

题目链接

倍增，预处理出每个点往后$2^i$个应该选哪个人

我用的treap就是快

 #include<algorithm>
 #include<iostream>
 #include<cstdlib>
 #include<cstring>
 #include<cstdio>
 #include<string>
 #include<cmath>
 #include<ctime>
 #include<queue>
 #include<stack>
 #include<map>
 #include<set>
 #define rre(i,r,l) for(int i=(r);i>=(l);i--)
 #define re(i,l,r) for(int i=(l);i<=(r);i++)
 #define Clear(a,b) memset(a,b,sizeof(a))
 #define inout(x) printf("%d",(x))
 #define douin(x) scanf("%lf",&x)
 #define strin(x) scanf("%s",(x))
 #define LLin(x) scanf("%lld",&x)
 #define op operator
 #define CSC main
 typedef unsigned long long ULL;
 typedef const int cint;
 typedef long long LL;
 using namespace std;
 void inin(int &ret)
 {
     ret=;int f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=;ch=getchar();}
     while(ch>=''&&ch<='')ret*=,ret+=ch-'',ch=getchar();
     ret=f?-ret:ret;
 }
 namespace treap
 {
     const int xxx=;
     int w[xxx],id[xxx],r[xxx],ch[xxx][],ed,root;
     void rotate(int &k,int d)
     {
         int p=ch[k][d^];
         ch[k][d^]=ch[p][d];
         ch[p][d]=k;k=p;
     }
     void add(int &k,int x,int ID)
     {
         if(!k)
         {
             k=++ed;w[k]=x,id[k]=ID;r[k]=rand();
             return ;
         }
         int d=x>w[k];
         add(ch[k][d],x,ID);
         if(r[ch[k][d]]<r[k])rotate(k,d^);
     }
     int findhou(int x)
     {
         int k=root,ret=;
         while(k)
             if(w[k]>x)ret=w[k],k=ch[k][];
             else k=ch[k][];
         return ret;
     }
     int findqian(int x)
     {
         if(!x)x=;
         int k=root,ret=;
         while(k)
             if(w[k]<x)ret=id[k],k=ch[k][];
             else k=ch[k][];
         return ret;
     }
     void add(int x,int ID){add(root,x,ID);}
 };
 int n,m;
 struct wocao
 {
     int l,r,id;
     void in(int i){inin(l),inin(r),id=i;if(r<l)r+=m;}
     bool op < (const wocao &a)const {return l<a.l;}
 }a[];
 int fa[][],ans[];
 void hh(int x)
 {
     int temp=a[x].id,R=m+a[x].l;
     rre(i,,)if(fa[x][i])
         if(a[fa[x][i]].r<R)
             x=fa[x][i],ans[temp]+=<<i;
 }
 set<pair<int,int> >ss;
 int main()
 {
     freopen("in.in","r",stdin);
     freopen("out.out","w",stdout);
     inin(n),inin(m);
     re(i,,n)a[i].in(i);
     re(i,n+,n<<)a[i]=a[i-n],a[i].l+=m,a[i].r+=m,a[i].id=;
     n<<=;
     sort(a+,a+n+);
 //    for(int i=1;i<=n;i++)printf("%d %d\n",a[i].l,a[i].r);
     treap::add(a[n].l,n);
 //    ss.insert(make_pair(a[n].l,n));
     rre(i,n-,)
     {
         fa[i][]=treap::findqian(treap::findhou(a[i].r));
 //        fa[i][0]=(--ss.upper_bound(make_pair(a[i].r,0x7FFFFFFF)))->second;
 //        printf("%d\n",fa[i][0]);
         treap::add(a[i].l,i);
 //        ss.insert(make_pair(a[i].l,i));
     }
     re(i,,)rre(j,n,)fa[j][i]=fa[fa[j][i-]][i-];
     re(i,,n)if(a[i].id)
         hh(i);
     re(i,,n>>)printf("%d ",ans[i]+);
     return ;
 }