题目链接
首先,激动的不知道说什么,看图就是了,本题时限2s,如图:
基本上就是卡着过去的,太刺激了吧!!!
然后这道题就是整体二分了,首先看到左右点,我们把能成立的点放进左子树去,不能成立的点,先减去我们上面已经消耗掉的部分(剪枝了),然后再去一个新的区间去看。这里有个特殊的地方,就是我们的查询答案,要多开一个点,就是为了加入我们第K个要不满足,就可以通过K+1来判断是否是不满足条件的点了。
这里面,我用的是线段树区间修改+永久化标记+单点查询来完成判断的操作,当然时间复杂度是真的高!哦不!常数是真的高!
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 3e5 + 7;
vector<int> G[maxN];
int N, M, K, o[maxN], ans[maxN];
ll need[maxN], tree[maxN<<2] = {0};
struct Question
{
int L, R;
ll A;
Question(int a=0, int b=0, ll c=0):L(a), R(b), A(c) {}
}q[maxN];
void update(int rt, int l, int r, int ql, int qr, ll val)
{
if(ql <= l && qr >= r)
{
tree[rt] += val;
return;
}
int mid = HalF;
if(qr <= mid) update(QL, val);
else if(ql > mid) update(QR, val);
else { update(QL, val); update(QR, val); }
}
inline ll query(int rt, int l, int r, int qx, ll val)
{
val += tree[rt];
if(l == r) return val;
int mid = HalF;
if(qx <= mid) return query(Lson, qx, val);
else return query(Rson, qx, val);
}
struct node
{
int id; ll need;
node(int a=0, ll c=0):id(a), need(c) {}
}a[maxN], cpy_true[maxN], cpy_fasle[maxN];
ll now_sum[maxN];
void cdq(int l_th, int r_th, int ans_l, int ans_r)
{
if(l_th > r_th || ans_l > ans_r) return;
if(ans_l == ans_r)
{
for(int i=l_th; i<=r_th; i++) ans[a[i].id] = ans_l;
return;
}
int ans_mid = (ans_l + ans_r) >> 1;
for(int i=ans_l; i<=ans_mid; i++)
{
if(!q[i].L && !q[i].R) continue;
if(q[i].L <= q[i].R) update(1, 1, M, q[i].L, q[i].R, q[i].A);
else
{
update(1, 1, M, q[i].L, M, q[i].A);
update(1, 1, M, 1, q[i].R, q[i].A);
}
}
for(int i=l_th; i<=r_th; i++) now_sum[a[i].id] = 0;
for(int i=l_th, len; i<=r_th; i++)
{
len = (int)G[a[i].id].size();
for(int j=0; j<len; j++)
{
if(now_sum[a[i].id] >= a[i].need) break;
now_sum[a[i].id] += query(1, 1, M, G[a[i].id][j], 0);
}
}
for(int i=ans_l; i<=ans_mid; i++)
{
if(!q[i].L && !q[i].R) continue;
if(q[i].L <= q[i].R) update(1, 1, M, q[i].L, q[i].R, -q[i].A);
else
{
update(1, 1, M, q[i].L, M, -q[i].A);
update(1, 1, M, 1, q[i].R, -q[i].A);
}
}
int TL = 0, TR = 0;
for(int i=l_th; i<=r_th; i++)
{
if(now_sum[a[i].id] >= a[i].need) cpy_true[++TL] = a[i];
else { a[i].need -= now_sum[a[i].id]; cpy_fasle[++TR] = a[i]; }
}
// sort(a + l_th, a + r_th + 1);
for(int i=l_th; i<l_th + TL; i++) a[i] = cpy_true[i - l_th + 1];
for(int i=l_th + TL; i<=r_th; i++) a[i] = cpy_fasle[i - l_th - TL + 1];
cdq(l_th, l_th + TL - 1, ans_l, ans_mid); cdq(l_th + TL, r_th, ans_mid + 1, ans_r);
}
int main()
{
scanf("%d%d", &N, &M);
for(int i=1; i<=M; i++)
{
scanf("%d", &o[i]);
G[o[i]].push_back(i);
}
for(int i=1; i<=N; i++) scanf("%lld", &need[i]);
scanf("%d", &K);
for(int i=1; i<=K; i++) scanf("%d%d%lld", &q[i].L, &q[i].R, &q[i].A);
for(int i=1; i<=N; i++) a[i] = node(i, need[i]);
cdq(1, N, 0, K + 1);
for(int i=1; i<=N; i++)
{
if(ans[i] <= K) printf("%d\n", ans[i]);
else printf("NIE\n");
}
return 0;
}