Stars
Time Limit:1000MS | Memory Limit:65536K | |
Total Submissions:24726 | Accepted:10782 |
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.
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
题意:按照纵坐标升序给出星星的坐标,每个星星的级别是在它下面和左面的星星数,从级别零到级别n - 1输出对应级别的星星数。
方法:使用树状数组,每个元素i存的是横坐标从1~i的个数,因为树状数组是从1开始的,而题目要求里面横坐标是从0开始的,所以每次处理前x需要加一。每输入一次就可以统计一下,得到的就是等级。由于是按照纵坐标递增顺序,纵坐标一样的就横坐标升序,所以,后面不会再有在当前星星的左下的星星出现。统计后再更新。对应得到的等级在rank[]数组里面对应的元素加一。最后顺序输出即可。
#include<cstdio>
#include<cstring>
#define lowbit(i) (i&(-i))
using namespace std;
int star[32001];
int rank[15001];
int sum(int x){
int ans = 0;
while(x > 0){
ans += star[x];
x -= lowbit(x);
}
return ans;
}
void update(int x){
while(x <= 32001){
star[x] ++;
x += lowbit(x);
}
}
int main(){
int n;
while(~scanf("%d",&n)){
int x, y;
memset(rank,0,sizeof(rank));
memset(star,0,sizeof(star));
for(int i = 1;i <= n;i ++){
scanf("%d%d",&x,&y);
x ++;
int loc = sum(x);
rank[loc]++;
update(x);
}
for(int i = 0;i < n;i ++)
printf("%d\n",rank[i]);
}
return 0;
}