【ybt金牌导航6-6-5】【luogu P3527】【luogu SP10264】流星雨 / MET-Meteors / METEORS - Meteors（树状数组）（整体二分）

流星雨 / MET-Meteors / METEORS - Meteors

题目链接：ybt金牌导航6-6-5 / luogu P3527 / luogu SP10264

题目大意

给你一个环，然后每个点有颜色，然后每个颜色有各自的需求，然后有一些事件。
每次是一个区间的每个位置加一定的分数，然后对于每个颜色求出第几次事件之后满足需求，或者得出一直都没有满足。

思路

代码

#include<cstdio>
#include<vector>
#define ll unsigned long long

using namespace std;

struct node {
	int op, l, r, id;
	ll a;
}q[600001], q1[600001], q2[600001];
int n, m, x, k;
vector <int> aa[300001];
int ans[300001];
ll p[300001];

struct XD_tree {//树状数组（线段树长度比较大）
	ll a[300001];
	
	void insert(int x, ll y) {
		for (; x <= m; x += x & (-x))
			a[x] += y;
	}
	
	ll query(int x) {
		ll re = 0;
		for (; x; x -= x & (-x)) re += a[x];
		return re;
	}
	
	void insert_(int l, int r, ll va) {
		insert(l, va); insert(r + 1, -va);
	}
	
	void Put(int l, int r, ll va) {
		if (l <= r) insert_(l, r, va);
			else insert_(l, m, va), insert_(1, r, va);
	}
	
	ll Ask(int x) {
		ll re = 0;
		for (int i = 0; i < aa[x].size(); i++)
			re += query(aa[x][i]);
		return re;
	}
}T;

void work(int l, int r, int L, int R) {//整体二分
	if (l > r) return ;
	if (L == R) {
		for (int i = l; i <= r; i++) {
			if (q[i].op) {
				T.Put(q[i].l, q[i].r, q[i].a);
				continue;
			}
			if (T.Ask(q[i].id) >= q[i].a) ans[q[i].id] = L;
				else ans[q[i].id] = -1;
		}
		for (int i = l; i <= r; i++)
			if (q[i].op)
				T.Put(q[i].l, q[i].r, -q[i].a);
		return ;
	}
	
	int n1 = 0, n2 = 0, mid = (L + R) >> 1;
	for (int i = l; i <= r; i++) {
		if (q[i].op) {
			if (q[i].id <= mid) T.Put(q[i].l, q[i].r, q[i].a), q1[++n1] = q[i];
				else q2[++n2] = q[i];
		}
		else {
			ll tmp = T.Ask(q[i].id);
			if (tmp >= q[i].a) q1[++n1] = q[i];
				else q[i].a -= tmp, q2[++n2] = q[i];
		}
	}
	for (int i = l; i <= r; i++)
		if (q[i].op && q[i].id <= mid) T.Put(q[i].l, q[i].r, -q[i].a);
	
	for (int i = 1; i <= n1; i++) q[l + i - 1] = q1[i];
	for (int i = 1; i <= n2; i++) q[l + n1 + i - 1] = q2[i];
	work(l, l + n1 - 1, L, mid); work(l + n1, r, mid + 1, R);
}

int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++) {
		scanf("%d", &x); aa[x].push_back(i);
	}
	for (int i = 1; i <= n; i++) scanf("%lld", &p[i]);
	scanf("%d", &k);
	for (int i = 1; i <= k; i++) {
		q[i].op = 1;
		scanf("%d %d %lld", &q[i].l, &q[i].r, &q[i].a);
		q[i].id = i;
	}
	for (int i = 1; i <= n; i++) {
		q[k + i].a = p[i]; q[k + i].id = i;
	}
	
	work(1, k + n, 1, k);
	for (int i = 1; i <= n; i++) {
		if (ans[i] == -1) printf("NIE\n");
			else printf("%d\n", ans[i]);
	}
	
	return 0;
}