HDU4614 Vases and Flowers

点此转到题目

前些天身体生病，再加上一些琐事，多校联合赛就这么没有做上，最近几天才恢复了刷题的进程，然后就简单浏览了一下多校的题，发现此题是一个赤裸裸的线段树，说起来虽然我前些天一直在努力地搞着图论里面的连通分量，这些天在搞SBT和佳哥的最短路题，好久没写线段树了，不过好歹线段树是我写得最久的了。。可是刚上来的时候被题坑了一下，怪我自己时间长没读题……然后现在把完整版代码献上。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
const int maxn = 50010;
int sum[maxn << 2], col[maxn << 2], ans;
void PushUp(int rt){
	sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}
void PushDown(int m, int rt){
	if (col[rt] != -1){
		col[rt << 1] = col[rt << 1 | 1] = col[rt];
		sum[rt << 1] = col[rt] ? 0 : (m - (m >> 1));
		sum[rt << 1 | 1] = col[rt] ? 0 : (m >> 1);
		col[rt] = -1;
	}
}
void build(int l, int r, int rt){
	sum[rt] = r - l + 1; col[rt] = -1;
	if (l == r) return;
	int m = (l + r) >> 1;
	build(lson);
	build(rson);
}
void update(int ll, int rr, int c, int l, int r, int rt){
	if (ll <= l && rr >= r){
		ans += (r - l + 1) - sum[rt];
		sum[rt] = c ? 0 : r - l + 1;
		col[rt] = c;
		return;
	}
	PushDown(r - l + 1, rt);
	int m = (l + r) >> 1;
	if (ll <= m) update(ll, rr, c, lson);
	if (rr > m) update(ll, rr, c, rson);
	PushUp(rt);
}
int get_sum(int x, int l, int r, int rt){
	if (l == x)
		return sum[rt];
	PushDown(r - l + 1, rt);
	int m = (l + r) >> 1;
	if (x <= m)
		return get_sum(x, lson) + sum[rt << 1 | 1];
	else return get_sum(x, rson);
	PushUp(rt);
}
int get_pos(int x, int l, int r, int rt){
	if (l == r) return l;
	PushDown(r - l + 1, rt);
	int m = (l + r) >> 1;
	if (sum[rt << 1] >= x)
		return get_pos(x, lson);
	else return get_pos(x - sum[rt << 1], rson);
	PushUp(rt);
}
int main(){
	//freopen("in.txt", "r", stdin);
	int cs, m, n;
	scanf("%d", &cs);
	while(cs--){
		scanf("%d%d", &n, &m);
		build(1, n, 1);
		while(m--){
			int op, x, y;
			scanf("%d%d%d", &op, &x, &y);
			if (op == 1){
				x += 1;
				int cur = get_sum(x, 1, n, 1);
				if (cur == 0){
					puts("Can not put any one.");
					continue;
				}
				int cnt = (sum[1] - cur);
				int ans1 = get_pos(cnt + 1, 1, n, 1);
				if (cur > y) cur = y;
				int ans2 = get_pos(cnt + cur, 1, n, 1);
				printf("%d %d\n", ans1 - 1, ans2 - 1);
				update(ans1, ans2, 1, 1, n, 1);
			}
			else{
				 x += 1; y += 1;
				 ans = 0; update(x, y, 0, 1, n, 1);
				 printf("%d\n", ans);
			}
		}
		puts("");
	}
	return 0;
}