[主席树] BZOJ 3932 [CQOI2015]任务查询系统

题目大意：前k大的和

裸题

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

inline char nc()
{
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(int &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=200005;

int n;
int root[N],ls[21*N],rs[21*N],cnt[21*N];
ll sum[21*N];
int ncnt;

int sx[N],icnt;
inline int Bin(int x){
	return lower_bound(sx+1,sx+icnt+1,x)-sx;
}

inline void update(int x){
	cnt[x]=cnt[ls[x]]+cnt[rs[x]];
	sum[x]=sum[ls[x]]+sum[rs[x]];
}

void Modify(int &y,int x,int l,int r,int t,int f){
	y=++ncnt; int mid=(l+r)>>1;
	if (l==r){
		cnt[y]=cnt[x]+f; 
		sum[y]=sum[x]+f*sx[t];
		return;
	}
	if (t<=mid) 
		rs[y]=rs[x],Modify(ls[y],ls[x],l,mid,t,f),update(y);
	else
		ls[y]=ls[x],Modify(rs[y],rs[x],mid+1,r,t,f),update(y);
}

inline ll Query(int y,int k,int l,int r){
	if (l==r)
		return min(k,cnt[y])*sx[l];
	int tmp=cnt[ls[y]],mid=(l+r)>>1;
	if (k<=tmp)
		return Query(ls[y],k,l,mid);
	else
		return sum[ls[y]]+Query(rs[y],k-tmp,mid+1,r);
}

struct event{
	int t,f,x;
	event(int t=0,int f=0,int x=0):t(t),f(f),x(x) { }
	bool operator < (const event& B) const {
		return t==B.t?(f==B.f?x<B.x:f<B.f):t<B.t;
	}
}eve[N];
int etot;

int main()
{
	int Q,a,b,c,l,r,K;
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	read(n); read(Q);
	for (int i=1;i<=n;i++)
	{
		read(l); read(r); read(a);
		eve[++etot]=event(l,1,a); eve[++etot]=event(r+1,-1,a);
		sx[++icnt]=a;
	}
	sort(sx+1,sx+icnt+1);
	icnt=unique(sx+1,sx+icnt+1)-sx-1;
	sort(eve+1,eve+etot+1);
	for (int i=1;i<=etot;i++)
	{
		eve[i].x=Bin(eve[i].x);
		Modify(root[i],root[i-1],1,icnt,eve[i].x,eve[i].f);
	}
	ll pre=1;
	while (Q--)
	{
		read(l); read(a); read(b); read(c);
		K=1+(pre*a+b)%c;
		int ed=lower_bound(eve+1,eve+etot+1,event(l,1,1<<30))-eve-1;
		pre=Query(root[ed],K,1,icnt);
		printf("%lld\n",pre);
	}
	return 0;
}