【BZOJ 2527】 [Poi2011]Meteors

原创 2015年05月12日 07:58:19

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已经预测了接下来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

HINT

Source

鸣谢 Object022

整体二分。

整体二分就是对于每一个点都计算在mid情况下是多还是少,把多的放在一边,少的放在一边,然后针对两种情况分别继续二分下去,直到得出答案。

对整个区间进行计算,使用树状数组优化,最终的时间复杂度大概是O(nlog2n)的。

#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);
}
void Add(int x,LL k)
{
    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)
{
    Add(l,k);
    Add(r+1,-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;
}

这里写图片描述

2527: [Poi2011]Meteors|整体二分

二分一个答案,对≤\leq这个答案的国家 分到左边一组,其余的分到右面一组继续向下分治递归处理 ps:ps:迷之WAWA可能是过程中爆了longlonglong long !!#include...
  • ws_yzy
  • ws_yzy
  • 2016年03月02日 19:05
  • 496

[BZOJ2527][Poi2011]Meteors(整体二分+bit)

题目描述传送门题解整体二分最少是哪个流星雨 每一次处理(l,mid)之间的修改然后再判断每一个询问是否满足 线段树的常数太大了…必须用bit才能过…代码#include #include #inc...

【POI2011】【BZOJ2527】Meteors

Description Byteotian Interstellar Union (BIU) has recently discovered a new planet in a nearby gal...

【bzoj2527】Meteors【整体二分】

有n个国家和m个空间站,每个空间站都属于一个国家,一个国家可以有多个空间站,所有空间站按照顺序形成一个环,也就是说,m号空间站和1号空间站相邻。 现在,将会有k场流星雨降临,每一场流星雨都会给区间[...

【BZOJ2527】【POI2011】Meteors(整体二分)

Byteotian Interstellar Union有N个成员国。现在它发现了一颗新的星球,这颗星球的轨道被分为M份(第M份和第1份相邻),第i份上有第Ai个国家的太空站。 这个星球经常会下陨石...

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

答案显然是具有二分性的,操作是区间加和单点查询,并且每个国家是独立的,我们考虑整体二分。 每次二分一个midmid,将[1,mid][1,mid]的操作区间都加入答案,然后分治。 容易想到用可持久...

BZOJ 2527 [Poi2011]Meteors [整体二分+线段树]

BZOJ 2527 [Poi2011]Meteors [整体二分+线段树]

[BZOJ2527][Poi2011][整体二分][树状数组]Meteors

整体二分区间[l,r]为当前处理修改操作区间,即陨石雨的区间,[L,R]为询问操作区间,即每个国家,那么执行[l,r]区间的修改,对于[L,R]中的每个国家,用树状数组查询收集到的陨石,如果大于希望获...
  • Coldef
  • Coldef
  • 2017年02月17日 22:42
  • 162

BZOJ 2527 [Poi2011] Meteors

整体二分+树状数组

bzoj2527: [Poi2011]Meteors

整体二分;#include #define rep(i,k,n) for(int i=k;i
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:【BZOJ 2527】 [Poi2011]Meteors
举报原因:
原因补充:

(最多只允许输入30个字)