HDU4614 Vases and Flowers

http://acm.hdu.edu.cn/showproblem.php?pid=4614

 HDU 4614 Vases and Flowers (2013多校第二场线段树)

// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <conio.h>
using namespace std;
#define clc(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
const int N = 50010;
const int MOD = 1e9+7;
#define LL long long
#define mi() (l+r)>>1
double const pi = acos(-1);
void fre() {
    freopen("in.txt","r",stdin);
}
// inline int r() {
//     int x=0,f=1;char ch=getchar();
//     while(ch>'9'||ch<'0') {if(ch=='-') f=-1;ch=getchar();}
//     while(ch>='0'&&ch<='9') { x=x*10+ch-'0';ch=getchar();}return x*f;
// }
struct Edge {
    int l,r;
    int lazy,sum;
} e[N<<2];

void pushdown(int rt) {
    e[rt].sum=e[rt<<1].sum+e[rt<<1|1].sum;
}
void pushup(int rt) {
    if(e[rt].lazy!=-1) {
        e[rt<<1].lazy=e[rt<<1|1].lazy=e[rt].lazy;
        e[rt<<1].sum=(e[rt<<1].r-e[rt<<1].l+1)*e[rt].lazy;
        e[rt<<1|1].sum=(e[rt<<1|1].r-e[rt<<1|1].l+1)*e[rt].lazy;
        e[rt].lazy=-1;
    }
}

void build(int l,int r,int rt) {
    e[rt].l=l;
    e[rt].r=r;
    e[rt].lazy=-1;
    if(l==r) {
        e[rt].sum=0;
        return;
    }
    int mid=mi();
    build(lson);
    build(rson);
    pushdown(rt);
}

int query(int l,int r,int rt) {
    if(e[rt].l==l&&e[rt].r==r) {
        return e[rt].sum;
    }
    pushup(rt);
    int mid=(e[rt].l+e[rt].r)>>1;
    if(r<=mid)  return query(l,r,rt<<1);
    else if(l>mid) return query(l,r,rt<<1|1);
    else return query(l,mid,rt<<1)+query(mid+1,r,rt<<1|1);
}

void update(int l,int r,int rt,int c){
     if(e[rt].l==l&&e[rt].r==r){
         e[rt].lazy=c;
         e[rt].sum=(e[rt].r-e[rt].l+1)*c;
         return;
     }
     pushup(rt);
     int mid=(e[rt].l+e[rt].r)>>1;
     if(r<=mid) update(l,r,rt<<1,c);
     else if(l>mid) update(l,r,rt<<1|1,c);
     else {
           update(l,mid,rt<<1,c);
           update(mid+1,r,rt<<1|1,c);
    }
     pushdown(rt);
}

int main() {
    // fre();
    int T;
    scanf("%d",&T);
    while(T--) {
        int n,q;
        cin>>n>>q;
        build(1,n,1);
        while(q--) {
            int op,a,b;
            cin>>op>>a>>b;
            if(op==1) {
                int L=a+1,R=n;
                int st,ed;
                if((n-L+1-query(L,n,1))==0) {
                    printf("Can not put any one.
");
                    continue;
                }
                st=inf;
                while(L<=R) {
                    int mid=(L+R)>>1;
                    if((mid-(a+1)+1-query(a+1,mid,1))>=1) {
                        st=min(st,mid);
                        R=mid-1;
                    } else {
                        L=mid+1;
                    }
                }
                int tem=n-st+1-query(st,n,1);
                if(tem<b) b=tem;
                ed=inf;
                L=st,R=n;
                while(L<=R) {
                    int mid=(L+R)>>1;
                    tem=mid-st+1-query(st,mid,1);
                    if(tem==b) {
                        ed=min(ed,mid);
                        R=mid-1;
                    } else if(tem>b) {
                        R=mid-1;
                    } else {
                        L=mid+1;
                    }
                }
                printf("%d %d
",st-1,ed-1);
                update(st,ed,1,1);
            } else {
                 printf("%d
",query(a+1,b+1,1));
                 update(a+1,b+1,1,0);
            }
        }
        cout<<endl;
    }
    return 0;
}