普通的区间修改的线段树,加上了二分。
操作是从a开始放b个。
我们首先搜寻a到n有几个空位置cnt,不等于0就可以继续往下走(题意说能放几个算几个)
之后我们要找a之后的第一个空格。也就是我们a到x中只有一个空位置。
这个x我们二分求,x就是我们的最左端。
之后我们要找最右端,就是从a开始,我们要找min(b,cnt)个。 也就是a到x有min(b,cnt)个。
x同样是二分即可。
#include <cstdio>
#include <cstdlib>#include <cstring>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
typedef long long LL;
const int inf = 1 << 30;
const LL INF = 1LL << 60;
const int MaxN = 50005;
int T, n, m;
struct segtree
{
int l, r;
int sum;
}tree[4 * MaxN + 5];
int lazy[4 * MaxN + 5];
void push_up(int rt) {
tree[rt].sum = tree[rt << 1].sum + tree[rt << 1 | 1].sum;
}
void Build(int rt, int l, int r) {
tree[rt].l = l, tree[rt].r = r;
tree[rt].sum = r - l + 1;
lazy[rt] = -1;
if(l == r) return;
int mid = (l + r) >> 1;
Build(rt << 1, l, mid);
Build(rt << 1 | 1, mid + 1, r);
push_up(rt);
}
void push_down(int rt) {
if(lazy[rt] != -1) {
lazy[rt << 1] = lazy[rt];
lazy[rt << 1 | 1] = lazy[rt];
int mid = (tree[rt].l + tree[rt].r) >> 1;
tree[rt << 1].sum = (mid - tree[rt].l + 1) * lazy[rt];
tree[rt << 1 | 1].sum = (tree[rt].r - mid) * lazy[rt];
lazy[rt] = -1;
}
}
void update(int rt, int L, int R, int c) {
if(L <= tree[rt].l && tree[rt].r <= R) {
tree[rt].sum = (tree[rt].r - tree[rt].l + 1) * c;
lazy[rt] = c;
return;
}
if(tree[rt].l == tree[rt].r) return;
push_down(rt);
int mid = (tree[rt].l + tree[rt].r) >> 1;
if(L <= mid) update(rt << 1, L, R, c);
if(R > mid) update(rt << 1 | 1, L, R, c);
push_up(rt);
}
int query(int rt, int L, int R) {
if(R < tree[rt].l || tree[rt].r < L) return 0;
if(L <= tree[rt].l && tree[rt].r <= R)
return tree[rt].sum;
push_down(rt);
int mid = (tree[rt].l + tree[rt].r) >> 1;
int res = 0;
if(L <= mid) res += query(rt << 1, L, R);
if(R > mid) res += query(rt << 1 | 1, L, R);
return res;
}
int bin_search(int x, int num) {
int l = x, r = n;
int mid = 0, ans = 0;
while(l <= r) {
mid = (l + r) >> 1;
if(query(1, x, mid) >= num) ans = mid, r = mid - 1;
else l = mid + 1;
}
return ans;
}
int main()
{
scanf("%d", &T);
while(T--) {
scanf("%d %d", &n, &m);
Build(1, 1, n);
for(int i = 1; i <= m; i++) {
int op;
scanf("%d", &op);
if(op == 1) {
int A, F;
scanf("%d %d", &A, &F);
A++;
int cnt = query(1, A, n);
if(cnt == 0) printf("Can not put any one.\n");
else {
int L = bin_search(A, 1);
int R = bin_search(A, min(cnt, F));
update(1, L, R, 0);
printf("%d %d\n", L - 1, R - 1);
}
}
else if(op == 2) {
int L, R;
scanf("%d %d", &L, &R);
L++; R++;
printf("%d\n", R - L + 1 - query(1, L, R));
update(1, L, R, 1);
}
}
printf("\n");
}
return 0;
}