luoguP3168

题目链接

$\mathbf{主席树}+\mathbf{差分}$

$对于每一个任务(s_i,e_i,p_i)将区间[s_i,e_i]左端点加上p_i，右端点后一位减去p_i$

$这样单点查询就变成了求\mathbf{前缀和}，也就是一个区间查询$
$于是我们成功的把这道题变成了主席树模板$
$用主席树维护区间前k小和$

$要注意的点$

$\bullet 差分应在右端点后一位进行减操作$
$\bullet 计算结果要用t[q].sum/t[q].cnt\ast k因为可能有超过多个相同的第k小数$
$\bullet 需要进行离散化，sort+unique$

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<utility>
#define LL long long
#define fi first
#define se second

using namespace std;

const int MAXN = 2e5 + 5;

pair<int,int> a[MAXN * 2];
int top = 0;
int b[MAXN];
int root[MAXN];

struct Node{
	int l,r,sum,cnt;
}t[MAXN * 20];

inline int read(){
	int n = 0,l = 1;
	char c = getchar();
	while(c < '0' || c > '9'){
		if(c == '-') l = -1;
		c = getchar();
	}
	while(c >= '0' &&  c <= '9'){
		n = (n << 1) + (n << 3 ) + (c & 15);
		c = getchar();
	}
	return n * l;
}

int built_tree(int l,int k,int r){
	k = ++ top; t[k].sum = 0; t[k].cnt = 0;
	if(l == r) return k;
	int mid = l + ((r - l) >> 1);
	t[k].l = built_tree(l,t[k].l,mid);
	t[k].r = built_tree(mid + 1,t[k].r,r);
	return k;
}

int update(int l,int k,int r,int x,int s){
	t[++ top] = t[k];
	k = top;
	if(l == r){
		t[k].cnt += s;
		t[k].sum += b[x] * s;
		return k;
	}
	int mid = l + ((r - l) >> 1);
	if(x <= mid) t[k].l = update(l,t[k].l,mid,x,s);
	else t[k].r = update(mid + 1,t[k].r,r,x,s);
	t[k].cnt = t[t[k].l].cnt + t[t[k].r].cnt;
	t[k].sum = t[t[k].l].sum + t[t[k].r].sum;
	return k;
}

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

int main(){
	int m = read(),n = read();
	for(int i = 1; i <= m; i ++){
		int p = (i << 1) - 1, q = i << 1;
		a[p].fi = read(); a[q].fi = read(); a[p].se = read();
		a[q].fi ++;
		a[q].se = -a[p].se;
		b[i] = a[p].se;
	}
	sort(b + 1,b + m + 1);
	int mm = unique(b + 1,b + m + 1) - b - 1;
	root[0] = built_tree(1,0,mm);
	sort(a + 1,a + (m << 1) + 1);
	int k = 1;
	for(int i = 1; i <= (m << 1); i ++){
		while(k < a[i].fi){
			root[k + 1] = root[k];
			k ++;
		}
		if(k == m + 1) break;
		int q = lower_bound(b + 1,b + mm + 1,abs(a[i].se)) - b;
		root[k] = update(1,root[k],mm,q,a[i].se > 0 ? 1 : -1);
	}
	int pre = 1;
	while(n --){
		int x = read(),a1 = read(),b1 = read(),c1 = read();
		int k = (1LL * a1 * pre + b1) % c1 + 1;
		if(k >= t[root[x]].cnt) pre = t[root[x]].sum;
		else pre = query(1,root[x],mm,k);
		printf("%d\n",pre);
	}
	return 0;
}