# 【BZOJ 2527】 [Poi2011]Meteors

### 2527: [Poi2011]Meteors

Time Limit: 60 Sec Memory Limit: 128 MB
Submit: 405 Solved: 160
[Submit][Status][Discuss]
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的第i个成员国希望能够收集Pi单位的陨石样本。你的任务是判断对于每个国家，它需要在第几次陨石雨之后，才能收集足够的陨石。

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

HINT

Source

#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#define LL long long
#define M 300005
#define inf 1500000000
using namespace std;
LL t[M];
int ans[M],n,m,he[M],k,ne[M];
struct data
{
int need,id;
LL cur;
}a[M],q[M];
struct Rain
{
int l,r,v;
}b[M];
int lowbit(int x)
{
return x&(-x);
}
{
if (!x) x++;
for (int i=x;i<=m;i+=lowbit(i))
t[i]+=k;
}
LL Getsum(int x)
{
LL ans=0;
for (int i=x;i;i-=lowbit(i))
ans+=t[i];
return ans;
}
void Update(int l,int r,LL k)
{
}
void Solve(int l,int r,int h,int t)
{
if (h>t) return;
if (l==r)
{
for (int i=h;i<=t;i++)
ans[a[i].id]=l;
return;
}
int mid=(l+r)>>1;
for (int i=l;i<=mid;i++)
if (b[i].l<=b[i].r)
Update(b[i].l,b[i].r,b[i].v);
else Update(1,b[i].r,b[i].v),Update(b[i].l,m,b[i].v);
int t1=h-1,t2=t+1;
for (int i=h;i<=t;i++)
{
LL tmp=0;
for (int j=he[a[i].id];j;j=ne[j])
tmp+=Getsum(j);
if (a[i].cur+tmp>=a[i].need)
q[++t1]=a[i];
else a[i].cur+=tmp,q[--t2]=a[i];
}
for (int i=h;i<=t;i++)
a[i]=q[i];
for (int i=l;i<=mid;i++)
if (b[i].l<=b[i].r)
Update(b[i].l,b[i].r,-b[i].v);
else Update(1,b[i].r,-b[i].v),Update(b[i].l,m,-b[i].v);
Solve(l,mid,h,t1);
Solve(mid+1,r,t2,t);
}
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=m;i++)
{
int x;
scanf("%d",&x);
ne[i]=he[x],he[x]=i;
}
for (int i=1;i<=n;i++)
{
scanf("%d",&a[i].need);
a[i].id=i;
}
scanf("%d",&k);
for (int i=1;i<=k;i++)
scanf("%d%d%d",&b[i].l,&b[i].r,&b[i].v);
b[++k].l=1,b[k].r=m,b[k].v=inf;
Solve(1,k,1,n);
for (int i=1;i<=n;i++)
{
if (ans[i]==k)
printf("NIE\n");
else printf("%d\n",ans[i]);
}
return 0;
}


• 本文已收录于以下专栏：

## 整体二分——BZOJ2527/Luogu3527 [POI2011]MET-Meteors

• jzq233jzq
• 2017年05月02日 11:30
• 223

## 【BZOJ】2527 [Poi2011]Meteors 整体二分+树状数组

• lyfsb
• 2017年07月11日 09:43
• 184

## 【BZOJ 2527】 [Poi2011]Meteors

• Regina8023
• 2015年05月12日 07:58
• 1798

## 【BZOJ2527】【POI2011】Meteors（整体二分）

Byteotian Interstellar Union有N个成员国。现在它发现了一颗新的星球，这颗星球的轨道被分为M份（第M份和第1份相邻），第i份上有第Ai个国家的太空站。 这个星球经常会下陨石...
• mousemjq
• 2017年03月16日 22:25
• 268

## bzoj-2527 Meteors

• ww140142
• 2015年09月22日 16:08
• 1205

## bzoj2527[Poi2011] Meteors

• u010336344
• 2017年01月16日 10:23
• 528

## BZOJ2527: [Poi2011]Meteors

• commonc
• 2016年10月09日 15:14
• 494

## 【bzoj2527】Meteors【整体二分】

• ZMOIYNLP
• 2015年05月12日 11:08
• 1709

## 2527: [Poi2011]Meteors|整体二分

• ws_yzy
• 2016年03月02日 19:05
• 526

## 2527: [Poi2011]Meteors 整体二分+树状数组

• Phenix_2015
• 2016年03月01日 19:00
• 361

举报原因： 您举报文章：【BZOJ 2527】 [Poi2011]Meteors 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)