# 【POI2011】【BZOJ2527】Meteors

1519人阅读 评论(0)

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。

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<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define MAXN 300100
#define lowbit(x)   (x&(-x))
#define ull unsigned long long
using namespace std;
int n,m,k;
int tot,now;
int ans[MAXN],w[MAXN];//ans 需求被满足的操作编号
ull c[MAXN];
struct list
{
int id;
list *next;
}s[MAXN],*prev[MAXN];//用链表记录每个国家的需求
void in(int &x)
{
char ch=getchar();x=0;
while (!(ch>='0'&&ch<='9')) ch=getchar();
while (ch>='0'&&ch<='9')    x=x*10+ch-'0',ch=getchar();
}
void insert(int x,int id)
{
s[++tot].id=id;s[tot].next=prev[x];prev[x]=&s[tot];
}
struct Query
{
int l,r,w;
}q[MAXN];//修改  二分过程中修改操作的顺序并没有改变所以不需要记录id值
int que[MAXN],newq[MAXN];//询问
{
for (int i=x;i<=m;i+=lowbit(i)) c[i]+=delta;
}
void modify(int x,int f)
{
}
ull query(int x)
{
ull ret=0;
for (int i=x;i;i-=lowbit(i))    ret+=c[i];
return ret;
}
void solve(int l,int r,int L,int R)
{
int mid=(l+r)>>1;//操作区间1 to mid
if (l==r)
{
for (int i=L;i<=R;i++)  ans[que[i]]=mid;
return;
}
while (now<mid) ++now,modify(now,1);
while (now>mid) modify(now,-1),now--;
int _L=L,_R=R;
for (int i=L;i<=R;i++)
{
ull tmp=0;
for (list *j=prev[que[i]];j;j=j->next)
{
tmp+=query(j->id);
if (tmp>=w[que[i]]) break;
}
if (tmp>=w[que[i]]) newq[_L++]=que[i];
else    newq[_R--]=que[i];
}
memcpy(que+L,newq+L,sizeof(int)*(R-L+1));
solve(l,mid,L,_L-1);solve(mid+1,r,_R+1,R);
}
int main()
{
in(n);in(m);
for (int i=1;i<=m;i++)
{
int x;
in(x);insert(x,i);
}
for (int i=1;i<=n;i++)  in(w[i]);
in(k);
for (int i=1;i<=k;i++)  in(q[i].l),in(q[i].r),in(q[i].w);
for (int i=1;i<=n;i++)  que[i]=i;
solve(1,k+1,1,n);//未被满足的操作ans统一标为k+1
for (int i=1;i<=n;i++)
{
if (ans[i]<=k)  printf("%d\n",ans[i]);
else    puts("NIE");
}
}
1
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：498839次
• 积分：10040
• 等级：
• 排名：第1812名
• 原创：452篇
• 转载：3篇
• 译文：1篇
• 评论：165条
文章分类
异次元の传送门
異次元的傳送門
異次元の傳送門
评论排行
最新评论