kuangbin_SegTree M (HDU 4553)

put my gezi这句话不得不说我看了好几秒才反应过来什么意思(你咋不上天呢

目测了一下也是区间合并 但是是成段更新的区间合并 但是!我终于!自己!写出来了!

嗯还算是比较顺利的 query的地方想了想也写出来了 就是lazy标记我竟然一时忘了怎么打(犯蠢了 后来想起来默认打上-1就行了

#include <cstdio>
#include <cmath>
#include <cstring>
#include <stack>
#include <algorithm>
#define INF 0x3f3f3f3f
#define mem(str,x) memset(str,(x),sizeof(str))
#define STOP puts("Pause");
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
using namespace std;
typedef long long LL;

const int MAXN = ;
int n, m;
int dsll[MAXN<<], dsrl[MAXN<<], dsml[MAXN<<], dslazy[MAXN<<];
int nsll[MAXN<<], nsrl[MAXN<<], nsml[MAXN<<], nslazy[MAXN<<];

inline void dspushdown(int l, int r, int rt){
    if(~dslazy[rt]){
        int m = (l + r) >> ;
        //printf("pushdown %d to %d\n", l, r);
        dslazy[rt<<] = dslazy[rt<<|] = dslazy[rt];
        dsll[rt<<] = dsrl[rt<<] = dsml[rt<<] = (m - l + ) * dslazy[rt];
        dsll[rt<<|] = dsrl[rt<<|] = dsml[rt<<|] = (r - m) * dslazy[rt];
        dslazy[rt] = -;
    }
}

inline void nspushdown(int l, int r, int rt){
    if(~nslazy[rt]){
        int m = (l + r) >> ;
        nslazy[rt<<] = nslazy[rt<<|] = nslazy[rt];
        nsll[rt<<] = nsrl[rt<<] = nsml[rt<<] = (m - l + ) * nslazy[rt];
        nsll[rt<<|] = nsrl[rt<<|] = nsml[rt<<|] = (r - m) * nslazy[rt];
        nslazy[rt] = -;
    }
}        

void build(int l, int r, int rt)
{
    dslazy[rt] = nslazy[rt] = -;
    dsll[rt] = dsrl[rt] = dsml[rt] = r - l + ;
    nsll[rt] = nsrl[rt] = nsml[rt] = r - l + ;
    if(l == r) return;
    int m = (l + r) >> ;
    build(lson);
    build(rson);
}

void dsupdate(int L, int R, int c, int l, int r, int rt)
{
    if(l >= L && r <= R){
        dslazy[rt] = c;
        dsll[rt] = dsrl[rt] = dsml[rt] = (r - l + ) * c;
        //printf("update ds from %d to %d into 0\n", l, r);
        return;
    }
    dspushdown(l, r, rt);
    int m = (l + r) >> ;
    if(L <= m) dsupdate(L, R, c, lson);
    if(R > m) dsupdate(L, R, c, rson);
    if((dsll[rt] = dsll[rt<<]) == m - l + ) dsll[rt] += dsll[rt<<|];
    if((dsrl[rt] = dsrl[rt<<|]) == r - m) dsrl[rt] += dsrl[rt<<];
    dsml[rt] = max(max(dsml[rt<<], dsml[rt<<|]), dsrl[rt<<] + dsll[rt<<|]);
}

void nsupdate(int L, int R, int c, int l, int r, int rt)
{
    if(l >= L && r <= R){
        nslazy[rt] = c;
        nsll[rt] = nsrl[rt] = nsml[rt] = (r - l + ) * c;
        return;
    }
    nspushdown(l, r, rt);
    int m = (l + r) >> ;
    if(L <= m) nsupdate(L, R, c, lson);
    if(R > m) nsupdate(L, R, c, rson);
    if((nsll[rt] = nsll[rt<<]) == m - l + ) nsll[rt] += nsll[rt<<|];
    if((nsrl[rt] = nsrl[rt<<|]) == r - m) nsrl[rt] += nsrl[rt<<];
    nsml[rt] = max(max(nsml[rt<<], nsml[rt<<|]), nsrl[rt<<] + nsll[rt<<|]);
}
//查询len长度的时间段起点 不存在则返回0
int dsquery(int len, int l, int r, int rt)
{
    //printf("check %d to %d ll = %d rl = %d ml = %d\n", l, r, dsll[rt], dsrl[rt], dsml[rt]);
    if(len > dsml[rt]) return ;
    int m = (l + r) >> ;
    if(len <= dsll[rt]) return l;
    if(len <= dsml[rt<<]) return dsquery(len, lson);
    else if(len <= dsrl[rt<<] + dsll[rt<<|]) return m + - dsrl[rt<<];
    else return dsquery(len, rson);
}

int nsquery(int len, int l, int r, int rt)
{
    if(len > nsml[rt]) return ;
    int m = (l + r) >> ;
    if(len <= nsll[rt]) return l;
    if(len <= nsml[rt<<]) return nsquery(len, lson);
    else if(len <= nsrl[rt<<] + nsll[rt<<|]) return m + - nsrl[rt<<];
    else return nsquery(len, rson);
}

int main()
{
    int t;
    scanf("%d", &t);
    for(int kase = ; kase <= t; kase++){
        int x, y, len;
        char order[];
        scanf("%d%d", &n, &m);
        build(, n, );
        printf("Case %d:\n", kase);
        while(m--){
            scanf("%s", order);
            if(order[] == 'D'){
                scanf("%d", &len);
                x = dsquery(len, , n, );
                if(x){
                    y = x + len - ;
                    dsupdate(x, y, , , n, );
                    printf("%d,let's fly\n", x);
                }
                else puts("fly with yourself");
            }
            else if(order[] == 'N'){
                scanf("%d", &len);
                x = dsquery(len, , n, );
                if(x){
                    y = x + len - ;
                    dsupdate(x, y, , , n, );
                    nsupdate(x, y, , , n, );
                    printf("%d,don't put my gezi\n", x);
                }
                else{
                    x = nsquery(len, , n, );
                    if(x){
                        y = x + len - ;
                        dsupdate(x, y, , , n, );
                        nsupdate(x, y, , , n, );
                        printf("%d,don't put my gezi\n", x);
                    }
                    else puts("wait for me");
                }
            }
            else{
                scanf("%d%d", &x, &y);
                dsupdate(x, y, , , n, );
                nsupdate(x, y, , , n, );
                puts("I am the hope of chinese chengxuyuan!!");
            }
        }
    }
    return ;
}