3932: [CQOI2015]任务查询系统

主席树裸题，
对于权值建立主席树。
然后直接跑R的版本，先跑左子树再跑右子树
如果$k = 0$直接返回即可
还有把一个任务分成两个操作
另外就是如果跑到根还没结束，就说明当前的点只能选 k k <script type="math/tex" id="MathJax-Element-4">k</script>个，特判即可
c++代码如下：

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x ; i <= y; ++ i)
#define repd(i,x,y) for(register int i = x ; i >= y; -- i)
using namespace std;
typedef long long ll;
template<typename T>inline void read(T&x)
{
    char c;int sign = 1;x = 0;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int N = 5e5 + 500;
int n,m,mx,cnt,id[N];
struct DATA { int t,p,op; }a[N];
ll ans;

const bool cmp(DATA a,DATA b) { return a.t < b.t; }

int rt[N*3],ls[10000000],rs[10000000],num[10000000],sz;
ll val[10000000];
void insert(int&rt,int y,int l,int r,int pos,int w)
{
    rt = ++ sz;
    ls[rt] = ls[y];rs[rt] = rs[y];
    num[rt] = num[y] + w;
    val[rt] = val[y] + 1ll*pos * w;
    if(l == r) return;
    int mid = l + r  >> 1;
    if(pos <= mid) insert(ls[rt],ls[y],l,mid,pos,w);
    else insert(rs[rt],rs[y],mid+1,r,pos,w);
}

ll k;
ll query(int rt,int l,int r)
{
    if(!k) return 0;
    if(num[rt] <= k)
    {
        k -= num[rt];
        return val[rt];
    }
    if(l == r)
    {
        int cnt = k;
        k = 0;
        return cnt * l;
    }
    int mid = l + r >> 1;
    return query(ls[rt],l,mid) + query(rs[rt],mid+1,r); 
}

int main()
{
    read(n); read(m);
    rep(i,1,n)
    {
        int s,e,p;
        read(s), read(e), read(p);  
        a[++cnt].t = s;a[cnt].p = p;a[cnt].op = 1;
        a[++cnt].t = e + 1;a[cnt].p = p;a[cnt].op = -1;
        mx = max(mx,p);
    }

    sort(a + 1,a + cnt + 1,cmp);

    int now = 0; ans = 1;
    rep(i,1,m)
    {
        while(a[now + 1].t <= i && now < cnt)     
            ++now,insert(rt[now],rt[now-1],1,mx,a[now].p,a[now].op);
        id[i] = now;
    }
    rep(i,1,m)
    {
        ll x,a,b,c;
        read(x); read(a); read(b); read(c);
        k = 1 + (a*ans + b) % c;
        printf("%lld\n",ans = query(rt[id[x]],1,mx));
    }

    return 0;
}