【题解】LuoGu3168： [CQOI2015]任务查询系统

原题传送门
嗯，区间修改+单点求值
仅仅是这样的话，用线段树/树状数组维护差分数组的前缀和即可

不过，本题加强了难度，要求操作中前k小的值对点进行修改

想到对于每个点都维护一颗权值线段树，不过空间不允许如此奢侈

我们把差分思想和权值线段树结合起来，并且凭着优化空间的目的，想到用主席树维护差分数组的前缀和，询问用权值线段树搞一搞

Code：

//感觉没什么好注释的，代码很好理解~~
#include <bits/stdc++.h>
#define maxn 200010
using namespace std;
struct node{
	int x, y;
	bool operator < (const node &z) const{
		return x < z.x;
	}
}a[maxn << 1];
int sz, rt[maxn], n, m, p, q, b[maxn], tot;
struct Seg{
	int l, r, cnt, sum;
}seg[maxn << 5];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

void build(int &rt, int l, int r){
	rt = ++sz;
	if (l == r) return;
	int mid = (l + r) >> 1;
	build(seg[rt].l, l, mid); build(seg[rt].r, mid + 1, r);
}

int update(int o, int l, int r, int k){
	int oo = ++sz;
	seg[oo] = seg[o];
	if (l == r){
		seg[oo].cnt += k;
		seg[oo].sum += k * b[p];
		return oo;
	}
	int mid = (l + r) >> 1;
	if (p <= mid) seg[oo].l = update(seg[oo].l, l, mid, k); else 
	seg[oo].r = update(seg[oo].r, mid + 1, r, k);
	seg[oo].cnt = seg[seg[oo].l].cnt + seg[seg[oo].r].cnt;
	seg[oo].sum = seg[seg[oo].l].sum + seg[seg[oo].r].sum;
	return oo;
}

int query(int rt, int l, int r, int k){
	if (l == r) return seg[rt].sum / seg[rt].cnt * k;
	int mid = (l + r) >> 1;
	if (seg[seg[rt].l].cnt >= k) return query(seg[rt].l, l, mid, k); else 
	return seg[seg[rt].l].sum + query(seg[rt].r, mid + 1, r, k - seg[seg[rt].l].cnt);
}

int main(){
	n = read(), m = read();
	for (int i = 1; i <= n; ++i){
		int x = read(), y = read(), z = read();
		a[++tot].x = x, a[tot].y = z;
		a[++tot].x = y + 1, a[tot].y = -z;
		b[i] = z;
	}
	sort(a + 1, a + 1 + tot);
	sort(b + 1, b + 1 + n);
	q = unique(b + 1, b + 1 + n) - b - 1;
	build(rt[0], 1, q);
	int k = 1;
	for (int i = 1; i <= tot; ++i){
		while (k < a[i].x) rt[k + 1] = rt[k], ++k;
		if (k == n + 1) break;
		p = lower_bound(b + 1, b + 1 + q, abs(a[i].y)) - b;
		rt[k] = update(rt[k], 1, q, a[i].y > 0 ? 1 : -1);
	}
	int ans = 1;
	while (m--){
		int tmp = read(), x = read(), y = read(), z = read();
		x = (1LL * x * ans + y) % z + 1;
		if (seg[rt[tmp]].cnt <= x) printf("%d\n", ans = seg[rt[tmp]].sum); else 
		printf("%d\n", ans = query(rt[tmp], 1, q, x));
	}
	return 0;
}