[BZOJ2527][Poi2011]Meteors

[Poi2011]Meteors

Description
Byteotian Interstellar Union (BIU) has recently discovered a new planet in a nearby galaxy. The planet is unsuitable for colonisation due to strange meteor showers, which on the other hand make it an exceptionally interesting object of study.
The member states of BIU have already placed space stations close to the planet’s orbit. The stations’ goal is to take samples of the rocks flying by. The BIU Commission has partitioned the orbit into msectors, numbered from 1to m, where the sectors 1and mare adjacent. In each sector there is a single space station, belonging to one of the nmember states.
Each state has declared a number of meteor samples it intends to gather before the mission ends. Your task is to determine, for each state, when it can stop taking samples, based on the meter shower predictions for the years to come.
Byteotian Interstellar Union有N个成员国。现在它发现了一颗新的星球，这颗星球的轨道被分为M份（第M份和第1份相邻），第i份上有第Ai个国家的太空站。
这个星球经常会下陨石雨。BIU已经预测了接下来K场陨石雨的情况。
BIU的第i个成员国希望能够收集Pi单位的陨石样本。你的任务是判断对于每个国家，它需要在第几次陨石雨之后，才能收集足够的陨石。
输入：
第一行是两个数N,M。
第二行有M个数，第i个数Oi表示第i段轨道上有第Oi个国家的太空站。
第三行有N个数，第i个数Pi表示第i个国家希望收集的陨石数量。
第四行有一个数K，表示BIU预测了接下来的K场陨石雨。
接下来K行，每行有三个数Li,Ri,Ai，表示第K场陨石雨的发生地点在从Li顺时针到Ri的区间中（如果Li<=Ri，就是Li,Li+1,…,Ri，否则就是Ri,Ri+1,…,m-1,m,1,…,Li），向区间中的每个太空站提供Ai单位的陨石样本。
输出：
N行。第i行的数Wi表示第i个国家在第Wi波陨石雨之后能够收集到足够的陨石样本。如果到第K波结束后仍然收集不到，输出NIE。
数据范围：
1<=n,m,k<=3*10^5
1<=Pi<=10^9
1<=Ai<10^9
Input
The first line of the standard input gives two integers, n and m(1<=n,m<=3*10^5) separated by a single space, that denote, respectively, the number of BIU member states and the number of sectors the orbit has been partitioned into.
In the second line there are mintegers Oi(1<=Oi<=n) separated by single spaces, that denote the states owning stations in successive sectors.
In the third line there are nintegers Pi(1<=Pi<=10^9) separated by single spaces, that denote the numbers of meteor samples that the successive states intend to gather.
In the fourth line there is a single integer k(1<=k<=3*10^5) that denotes the number of meteor showers predictions. The following klines specify the (predicted) meteor showers chronologically. The i-th of these lines holds three integers Li, Ri, Ai(separated by single spaces), which denote that a meteor shower is expected in sectors Li,Li+1,…Ri (if Li<=Ri) or sectors Li,Li+1,…,m,1,…Ri (if Li>Ri), which should provide each station in those sectors with Aimeteor samples (1<=Ai<10^9).
In tests worth at least 20% of the points it additionally holds that .
Output
Your program should print nlines on the standard output. The i-th of them should contain a single integer Wi, denoting the number of shower after which the stations belonging to the i-th state are expected to gather at least Pi samples, or the word NIE (Polish for no) if that state is not expected to gather enough samples in the foreseeable future.
Sample Input
3 5
1 3 2 1 3
10 5 7
3
4 2 4
1 3 1
3 5 2
Sample Output
3
NIE
1

Solution
首先要我们求的答案，即最少需要的流星雨次数满足二分性。我们唯一的操作是区间加上一个数，这个操作相互独立，互不影响，满足交换律和结合律，具有可加性，且题目允许离线，因此我们使用整体二分来解决这一问题

Code

#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, r, l) for (int i = (r); i >= (l); i--)
#define REP(i, r) for (int i = 0; i < (r); i++)
#define X first
#define Y second
#define MS(_) memset(_, 0, sizeof(_))
#define MP make_pair
#define PB push_back
#define debug(...) fprintf(stderr, __VA_ARGS__)
template<typename T> inline void read(T &x){
    x = 0; T f = 1; char ch = getchar();
    while (!isdigit(ch)) {if (ch == '-') f = -1; ch = getchar();}
    while (isdigit(ch))  {x = x * 10 + ch - '0'; ch = getchar();}
    x *= f;
}
const int INF = 0x7ffffff;
const int N = 333333;
typedef long long ll;

int n, m, K, T;
int l[N], r[N], val[N], p[N], id[N], tmp[N], ans[N];
vector<int> a[N];
bool mark[N];
ll BIT[N];
inline ll query(int x){
    ll tmp = 0;
    for(int i = x; i; i -= i&-i) tmp += BIT[i];
    return tmp;
}
inline void add(int x, int val){
    if (x > m) return;
    for (int i = x; i <= m; i += i & -i) BIT[i] += val;
}
inline void modify(int k, int f){
    if (l[k] <= r[k]) {add(l[k], f*val[k]), add(r[k]+1, f*(-val[k]));}
    else{
        add(1, f*val[k]); add(r[k]+1, f*(-val[k])); add(l[k], f*val[k]); 
    }
}
inline void Divide_Conquer(int l, int r, int L, int R){
    if (l > r) return; 
    if (L == R){ rep(i, l, r) ans[id[i]] = L; return; }
    int mid = L+R>>1;
    while (T <= mid) T++, modify(T, 1);
    while (T > mid) modify(T, -1), T--;
    int cnt = 0, now; ll tot;
    for (int i = l; i <= r; i++){ tot = 0; now = id[i];
        for (int j = 0; j < a[now].size() && tot < p[now]; j++)
            tot += query(a[now][j]);
        if (tot >= p[now]) mark[now] = 1, cnt++;
        else mark[now] = 0;
    }
    int l1 = l, l2 = l+cnt;
    rep(i, l, r) tmp[mark[id[i]] ? (l1++) : (l2++)] = id[i];
    rep(i, l, r) id[i] = tmp[i];
    Divide_Conquer(l, l1-1, L, mid);
    Divide_Conquer(l1, l2-1, mid+1, R);
}

int main(){
    read(n); read(m);
    rep(i, 1, m){ int x; read(x); a[x].PB(i); }
    rep(i, 1, n) read(p[i]);
    read(K);
    rep(i, 1, K) read(l[i]), read(r[i]), read(val[i]);
    l[++K] = 1; r[K] = m; val[K] = INF;
    rep(i, 1, n) id[i] = i;
    Divide_Conquer(1, n, 1, K);
    rep(i, 1, n)
        if (ans[i] != K) printf("%d\n", ans[i]);
        else puts("NIE");
    return 0;
}