Stars
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 28390 | Accepted: 12440 |
Description
Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and not to the right of the given star. Astronomers want to know the distribution of the levels of the stars.
For example, look at the map shown on the figure above. Level of the star number 5 is equal to 3 (it's formed by three stars with a numbers 1, 2 and 4). And the levels of the stars numbered by 2 and 4 are 1. At this map there are only one star of the level 0, two stars of the level 1, one star of the level 2, and one star of the level 3.
You are to write a program that will count the amounts of the stars of each level on a given map.
![](http://poj.org/images/2352_1.jpg)
For example, look at the map shown on the figure above. Level of the star number 5 is equal to 3 (it's formed by three stars with a numbers 1, 2 and 4). And the levels of the stars numbered by 2 and 4 are 1. At this map there are only one star of the level 0, two stars of the level 1, one star of the level 2, and one star of the level 3.
You are to write a program that will count the amounts of the stars of each level on a given map.
Input
The first line of the input file contains a number of stars N (1<=N<=15000). The following N lines describe coordinates of stars (two integers X and Y per line separated by a space, 0<=X,Y<=32000). There can be only one star at one point of the plane. Stars are listed in ascending order of Y coordinate. Stars with equal Y coordinates are listed in ascending order of X coordinate.
Output
The output should contain N lines, one number per line. The first line contains amount of stars of the level 0, the second does amount of stars of the level 1 and so on, the last line contains amount of stars of the level N-1.
Sample Input
5 1 1 5 1 7 1 3 3 5 5
Sample Output
1 2 1 1 0
Hint
This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.
Source
给出一些点,问每个点的level值,Let the level of a star be an amount of the stars that are not higher and not to the right of the given star。。又因为给出的点全部是按纵坐标升序给出,那么直接对横坐标利用树状数组即可解决,其实就是个区间求和的问题,代码如下:
/**********************
* author:crazy_石头
* Pro:POJ 2352-stars
* algorithm:树状数组
* Time:157ms
* Judge Status:Accepted
***********************/
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
#define LL long long
#define rep(i,h,n) for(int i=(h);i<=(n);i++)
#define ms(a,b) memset((a),(b),sizeof(a))
#define INF 1<<29
const int maxn=15500+5;
const int maxm=32000+5;
const LL mod=10000007 ;
int C[maxm];//树状数组;
int hash[maxn],n;
inline int lowbit(int x)
{
return x&-x;
}
inline void update(int x,int d)
{
while(x<=maxm)
{
C[x]+=d;
x+=lowbit(x);
}
}
inline int getsum(int x)
{
int res=0;
while(x>0)
{
res+=C[x];
x-=lowbit(x);
}
return res;
}
int main()
{
while(~scanf("%d",&n))
{
ms(C,0);
ms(hash,0);
rep(i,1,n)
{
int x,y;
scanf("%d%d",&x,&y);
int ret;
ret=getsum(x+1);//避免x=0的情况;
hash[ret]++;
update(x+1,1);
}
rep(i,0,n-1)
{
printf("%d\n",hash[i]);
}
}
return 0;
}