# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102725 | bakpark | Meteors (POI11_met) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
#include <memory.h>
#include <vector>
using namespace std;
#define ll long long
struct quer{
int l,r;
ll val;
};
int N,M,Q;
ll tree[1200000];
ll need[300001];
quer q[300001];
vector<int> arr[300001];
vector<int> bs[300001];
int L[300001],R[300001],answ[300001];
int MAX=1;
void push(int x,int l,int r,int LL,int RR,ll val){
if(r<LL||RR<l) return;
if(LL<=l&&r<=RR){
tree[x]+=val;
return;
}
int m = (l+r)>>1;
push(x<<1,l,m,LL,RR,val);
push((x<<1)+1,m+1,r,LL,RR,val);
}
ll get(int pos){
ll sum = 0;
int x = MAX-1+pos;
while(x>0){
sum+=tree[x];
x = x>>1;
}
return sum;
}
int main(){
scanf("%d %d",&N,&M);
while(MAX<M){
MAX = MAX<<1;
}
last =MAX-1;
for(int i=1;i<=M;i++){
int tmp;
scanf("%d",&tmp);
arr[tmp].push_back(i);
}
for(int i=1;i<=N;i++) scanf("%lld",&need[i]);
scanf("%d",&Q);
for(int i=1;i<=Q;i++) {
scanf("%d %d %lld",&q[i].l,&q[i].r,&q[i].val);
}
for(int i=1;i<=N;i++){
L[i] = 1;
R[i] = Q;
answ[i] = -1;
bs[(Q+1)>>1].push_back(i);
}
bool flag = true;
while(flag){
memset(tree,0,sizeof(tree));
flag = false;
for(int i=1;i<=Q;i++){
int l = q[i].l,q[i].r;
ll val = q[i].val;
if(l<=r){
push(1,1,MAX,l,r,val);
}
else{
push(1,1,MAX,l,M,val);
push(1,1,MAX,1,r,val);
}
for(int ver:bs[i]){
ll sum = 0;
for(int pos:arr[ver]){
sum+=get(pos);
}
if(sum>=need[ver]){
R[ver] = i-1;
answ[ver] = i;
}
else L[ver] = i+1;
if(L[ver]<=R[ver]){
int m = (L[ver]+R[ver])>>1;
bs[m].push_back(ver);
if(m<i) flag = true;
}
}
bs[i].clear();
}
}
for(int i=1;i<=N;i++){
if(answ[i]==-1) printf("NIE\n");
else printf("%d\n",answ[i]);
}
}