BZOJ 3110 树套树 && 永久化标记

感觉树套树是个非常高深的数据结构。从来没写过

 #include <iostream>
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <vector>
 #define LL long long
 using namespace std;
 const LL Maxm=;
 const LL Maxn=;
 const LL T=;
 struct OPERATOR
 {
     LL Type,a,b,c;
 }Operator[Maxm];
 LL Sum[Maxn*T],ls[Maxn*T],rs[Maxn*T],Addv[Maxn*T],sz=,V[Maxm],Root[Maxn*];
 LL n,m,H;
 inline void Get_Int(LL &x)
 {
     x=; register char ch=getchar(); LL f=;
     while (ch<'' || ch>'') {if (ch=='-') f=-; ch=getchar();}
     while (ch>='' && ch<='') {x=x*+ch-''; ch=getchar();} x*=f;
 }
 inline void Put_Int(LL x)
 {
     char ch[]; register int top=;
     if (x==) ch[++top]='';
     while (x) ch[++top]=x%+'',x/=;
     while (top) putchar(ch[top--]); putchar('\n');
 }
 //=================================================================
 inline void Push_Down(LL o,LL p,LL q)
 {
     if (!ls[o]) ls[o]=++sz;
     if (!rs[o]) rs[o]=++sz;
     LL l=ls[o],r=rs[o];
     if (Addv[o])
     {
         Addv[l]+=Addv[o];
         Addv[r]+=Addv[o];
         LL mid=(p+q)>>;
         Sum[l]+=(mid-p+)*Addv[o];
         Sum[r]+=(q-mid)*Addv[o];
         Addv[o]=;
     }
 }
 inline void Push_Up(LL o) {Sum[o]=Sum[ls[o]]+Sum[rs[o]];}
 void Add_Num(LL &o,LL l,LL r,LL p,LL q)
 {
     if (o==) o=++sz;
     if (l==p && r==q)
     {
         Sum[o]+=(q-p+);
         Addv[o]++;
         return;
     }
     Push_Down(o,l,r);
     LL mid=(l+r)>>;
     if (q<=mid) Add_Num(ls[o],l,mid,p,q);
     if (p>=mid+) Add_Num(rs[o],mid+,r,p,q);
     if (p<=mid && q>=mid+)
         Add_Num(ls[o],l,mid,p,mid),Add_Num(rs[o],mid+,r,mid+,q);
     Push_Up(o);
 }
 void Update(LL o,LL l,LL r,LL p,LL q,LL c)
 {
     Add_Num(Root[o],,n,p,q);
     if (l==r) return;
     LL mid=(l+r)>>;
     if (c<=mid) Update(o<<,l,mid,p,q,c);
     if (c>=mid+) Update(o<<|,mid+,r,p,q,c);
 }
 //========================================

 LL Get_Sum(LL o,LL l,LL r,LL p,LL q)
 {
     if (!o) return ;
     if (p==l && r==q) return Sum[o];
     LL mid=(l+r)>>;
     Push_Down(o,l,r);
     if (q<=mid) return Get_Sum(ls[o],l,mid,p,q);
     if (p>=mid+) return Get_Sum(rs[o],mid+,r,p,q);
     if (p<=mid && q>=mid+) return Get_Sum(ls[o],l,mid,p,mid)+Get_Sum(rs[o],mid+,r,mid+,q);
 }

 LL Query(LL o,LL l,LL r,LL p,LL q,LL k)
 {
     LL ret=Get_Sum(Root[o<<],,n,p,q);
     if (l==r) return l;
     LL mid=(l+r)>>;
     if (k<=ret) return Query(o<<,l,mid,p,q,k);
     if (k>=ret+) return Query(o<<|,mid+,r,p,q,k-ret);
 }

 int main()
 {
     Get_Int(n),Get_Int(m);  LL cnt=;
     for (int i=;i<=m;i++)
     {
         Get_Int(Operator[i].Type);
         Get_Int(Operator[i].a),Get_Int(Operator[i].b),Get_Int(Operator[i].c);
         if (Operator[i].Type==) V[++cnt]=Operator[i].c;
     }
     sort(V+,V+cnt+);
     H=unique(V+,V+cnt+)-(V+);
     for (int i=;i<=m;i++)
     {
         if (Operator[i].Type==) Update(,,H,Operator[i].a,Operator[i].b,H-(lower_bound(V+,V+H+,Operator[i].c)-V)+);
         if (Operator[i].Type==) Put_Int(V[H-Query(,,H,Operator[i].a,Operator[i].b,Operator[i].c)+]);
     }
     return ;
 }

C++

加了标记永久化以后

 #include <iostream>
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <vector>
 #define LL long long
 using namespace std;
 const LL Maxm=;
 const LL Maxn=;
 const LL T=;
 struct OPERATOR
 {
     LL Type,a,b,c;
 }Operator[Maxm];
 LL Sum[Maxn*T],ls[Maxn*T],rs[Maxn*T],Addv[Maxn*T],sz=,V[Maxm],Root[Maxn*];
 LL n,m,H;
 inline void Get_Int(LL &x)
 {
     x=; register char ch=getchar(); LL f=;
     while (ch<'' || ch>'') {if (ch=='-') f=-; ch=getchar();}
     while (ch>='' && ch<='') {x=x*+ch-''; ch=getchar();} x*=f;
 }
 inline void Put_Int(LL x)
 {
     char ch[]; register int top=;
     if (x==) ch[++top]='';
     while (x) ch[++top]=x%+'',x/=;
     while (top) putchar(ch[top--]); putchar('\n');
 }
 //=================================================================
 void Add_Num(LL &o,LL l,LL r,LL p,LL q)
 {
     if (o==) o=++sz;
     Sum[o]+=(q-p+);
     if (l==p && r==q)
     {
         Addv[o]++;
         return;
     }
     if (!ls[o]) ls[o]=++sz;
     if (!rs[o]) rs[o]=++sz;
     LL mid=(l+r)>>;
     if (q<=mid) Add_Num(ls[o],l,mid,p,q);
     if (p>=mid+) Add_Num(rs[o],mid+,r,p,q);
     if (p<=mid && q>=mid+)
         Add_Num(ls[o],l,mid,p,mid),Add_Num(rs[o],mid+,r,mid+,q);
 }
 void Update(LL o,LL l,LL r,LL p,LL q,LL c)
 {
     Add_Num(Root[o],,n,p,q);
     if (l==r) return;
     LL mid=(l+r)>>;
     if (c<=mid) Update(o<<,l,mid,p,q,c);
     if (c>=mid+) Update(o<<|,mid+,r,p,q,c);
 }
 //========================================

 LL Get_Sum(LL o,LL l,LL r,LL p,LL q,LL pos)
 {
     if (!o) return ;
     if (p==l && r==q) return Sum[o]+pos*(r-l+);
     LL mid=(l+r)>>;
     if (!ls[o]) ls[o]=++sz;
     if (!rs[o]) rs[o]=++sz;
     if (q<=mid) return Get_Sum(ls[o],l,mid,p,q,pos+Addv[o]);
     if (p>=mid+) return Get_Sum(rs[o],mid+,r,p,q,pos+Addv[o]);
     if (p<=mid && q>=mid+) return Get_Sum(ls[o],l,mid,p,mid,pos+Addv[o])+Get_Sum(rs[o],mid+,r,mid+,q,pos+Addv[o]);
 }

 LL Query(LL o,LL l,LL r,LL p,LL q,LL k)
 {
     LL ret=Get_Sum(Root[o<<],,n,p,q,);
     if (l==r) return l;
     LL mid=(l+r)>>;
     if (k<=ret) return Query(o<<,l,mid,p,q,k);
     if (k>=ret+) return Query(o<<|,mid+,r,p,q,k-ret);
 }

 int main()
 {
     // freopen("sequence.in","r",stdin);
     // freopen("sequence.out","w",stdout);
     Get_Int(n),Get_Int(m);  LL cnt=;
     for (int i=;i<=m;i++)
     {
         Get_Int(Operator[i].Type);
         Get_Int(Operator[i].a),Get_Int(Operator[i].b),Get_Int(Operator[i].c);
         if (Operator[i].Type==) V[++cnt]=Operator[i].c;
     }
     sort(V+,V+cnt+);
     H=unique(V+,V+cnt+)-(V+);
     for (int i=;i<=m;i++)
     {
         if (Operator[i].Type==) Update(,,H,Operator[i].a,Operator[i].b,H-(lower_bound(V+,V+H+,Operator[i].c)-V)+);
         if (Operator[i].Type==) Put_Int(V[H-Query(,,H,Operator[i].a,Operator[i].b,Operator[i].c)+]);
     }
     return ;
 }

C++

直接20s卡时，加了标记永久化之后18s，还是很慢！