标签：排列 algo CQ eal etc stdout uniq 注意 https
很水但是很恶心
首先不难想到对两个端点进行差分
然后把主席树建出来就可以了
注意要开ll
另外，叶子节点的总权值可能大于查询的个数，需要特判
#include<cstdio> #include<algorithm> #include<vector> #define int long long using namespace std; const int MAXN = 1e6 + 10; inline int read() { char c = getchar(); int x = 0, f = 1; while(c < ‘0‘ || c > ‘9‘) {if(c == ‘-‘) f = -1; c = getchar();} while(c >= ‘0‘ && c <= ‘9‘) x = x * 10 + c - ‘0‘, c = getchar(); return x * f; } int N, M, PRE = 1; struct node { int ls, rs, sum, siz; }T[MAXN * 6]; int root[MAXN], tot = 0, realrt[MAXN]; int S[MAXN], E[MAXN], tmp[MAXN], P[MAXN]; vector<int>v[MAXN]; #define rs(x) T[x].rs #define ls(x) T[x].ls int insert(int &now, int pre, int l, int r, int pos, int val) { now = ++tot; T[now] = T[pre]; T[now].sum += val; val > 0 ? T[now].siz++ : T[now].siz--; if(l == r) return now; int mid = l + r >> 1; if(pos <= mid) ls(now) = insert(ls(now), ls(pre), l, mid, pos, val); else rs(now) = insert(rs(now), rs(pre), mid + 1, r, pos, val); return now; } int Query(int now, int l, int r, int val) { if(l == r) return min(val * tmp[l], T[now].sum); int mid = l + r >> 1; if(val <= T[ls(now)].siz) return Query(ls(now), l, mid, val); else return Query(rs(now), mid + 1, r, val - T[ls(now)].siz) + T[ls(now)].sum; } main() { #ifdef WIN32 freopen("a.in", "r", stdin); freopen("a.out", "w", stdout); #endif N = read(); M = read(); for(int i = 1; i <= N; i++) { S[i] = read(), E[i] = read(), tmp[i] = P[i] = read(); } sort(tmp + 1, tmp + N + 1); int num = unique(tmp + 1, tmp + N + 1) - tmp - 1; for(int i = 1; i <= N; i++) { P[i] = lower_bound(tmp + 1, tmp + num + 1, P[i]) - tmp; v[S[i]].push_back(P[i]); v[E[i] + 1].push_back(-P[i]); } int cur = 0; for(int i = 1; i <= 100000; i++) { for(int j = 0; j < v[i].size(); j++) cur++, insert(root[cur], root[cur - 1], 1, num, abs(v[i][j]), v[i][j] < 0 ? -tmp[-v[i][j]] : tmp[v[i][j]]); realrt[i] = cur; } for(int i = 1; i <= M; i++) { int Xi = read(), Ai = read(), Bi = read(), Ci = read(); int Ki = 1 + (Ai * PRE + Bi) % Ci; PRE = Query(root[realrt[Xi]], 1, num, Ki); printf("%lld\n", PRE); } }
标签：排列 algo CQ eal etc stdout uniq 注意 https
原文地址：https://www.cnblogs.com/zwfymqz/p/9060661.html
