hdoj 4553 约会安排 【线段树区间合并】

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (100000+10)
#define MAXM (500000)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
struct Tree
{
int l, r, len;
int lsum, rsum, sum;
int lazy;
};
Tree tree[2][MAXN<<2];
void PushUp(int o)
{
for(int i = 0; i < 2; i++)
{
tree[i][o].lsum = tree[i][ll].lsum;
tree[i][o].rsum = tree[i][rr].rsum;
tree[i][o].sum = max(tree[i][ll].sum, tree[i][rr].sum);
//tree[i][o].sum = max(tree[i][o].lsum, tree[i][o].rsum);//犯二写错了
tree[i][o].sum = max(tree[i][o].sum, tree[i][ll].rsum + tree[i][rr].lsum);
if(tree[i][o].lsum == tree[i][ll].len)
tree[i][o].lsum += tree[i][rr].lsum;
if(tree[i][o].rsum == tree[i][rr].len)
tree[i][o].rsum += tree[i][ll].rsum;
}
}
void PushDown(int o)
{
for(int i = 0; i < 2; i++)
{
if(tree[i][o].lazy != -1)
{
tree[i][ll].lazy = tree[i][rr].lazy = tree[i][o].lazy;
tree[i][ll].sum = tree[i][ll].lsum = tree[i][ll].rsum = tree[i][o].lazy * tree[i][ll].len;
tree[i][rr].sum = tree[i][rr].lsum = tree[i][rr].rsum = tree[i][o].lazy * tree[i][rr].len;
tree[i][o].lazy = -1;
}
}
}
void Build(int o, int l, int r)
{
for(int i = 0; i < 2; i++)
{
tree[i][o].l = l; tree[i][o].r = r;
tree[i][o].len = r-l+1;
tree[i][o].sum = tree[i][o].lsum = tree[i][o].rsum = r-l+1;
tree[i][o].lazy = -1;
}
if(l == r)
return ;
int mid = (l + r) >> 1;
Build(lson); Build(rson);
}
void Update(int o, Tree *T, int L, int R, int v)
{
if(T[o].l >= L && T[o].r <= R)
{
T[o].lazy = v;
T[o].sum = T[o].lsum = T[o].rsum = T[o].len * v;
return ;
}
PushDown(o);
int mid = (T[o].l + T[o].r) >> 1;
if(R <= mid)
Update(ll, T, L, R, v);
else if(L > mid)
Update(rr, T, L, R, v);
else
{
Update(ll, T, L, mid, v);
Update(rr, T, mid+1, R, v);
}
PushUp(o);
}
int Query(int o, Tree *T, int len)
{
if(T[o].l == T[o].r)
return T[o].l;
PushDown(o);
if(T[ll].sum >= len)
return Query(ll, T, len);
else if(T[ll].rsum + T[rr].lsum >= len)
return T[ll].r - T[ll].rsum + 1;
else
return Query(rr, T, len);
}
int main()
{
int t, kcase = 1; Ri(t);
W(t)
{
int N, Q; Ri(N); Ri(Q);
Build(1, 1, N);
printf("Case %d:\n", kcase++);
W(Q)
{
char op[10];
Rs(op); int x, y;
if(op[0] == 'D')
{
Ri(x);
if(tree[0][1].sum < x)
printf("fly with yourself\n");
else
{
int s = Query(1, tree[0], x);
printf("%d,let's fly\n", s);
Update(1, tree[0], s, s+x-1, 0);
}
}
else if(op[0] == 'N')
{
Ri(x);
if(tree[0][1].sum < x && tree[1][1].sum < x)
printf("wait for me\n");
else if(tree[0][1].sum >= x)
{
int s = Query(1, tree[0], x);
printf("%d,don't put my gezi\n", s);
Update(1, tree[1], s, s+x-1, 0);
Update(1, tree[0], s, s+x-1, 0);
}
else
{
int s = Query(1, tree[1], x);
printf("%d,don't put my gezi\n", s);
Update(1, tree[1], s, s+x-1, 0);
Update(1, tree[0], s, s+x-1, 0);
}
}
else
{
Ri(x); Ri(y);
Update(1, tree[0], x, y, 1);
Update(1, tree[1], x, y, 1);
printf("I am the hope of chinese chengxuyuan!!\n");
}
}
}
return 0;
}