B. Stars
Time Limit: 1000ms
Case Time Limit: 1000ms
Memory Limit: 65536KB
64-bit integer IO format:
%lld Java class name:
Main
Font Size:
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 on ly on
e star of the level 0, two stars of the level 1, on
e star of the level 2, and on
e 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.
![B Stars - JIM - 叶沁寒 B Stars - JIM - 叶沁寒](http://www.bnuoj.com/bnuoj/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 on
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 on
ly on
e star at on
e 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, on
e 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 da
ta,use scanf() instead of cin to read da
ta to avoid time limit exceed.
#include<stdio.h> #include<string.h> int n,c[32001],b[32001]; int lowbit(int x) { return x&(-x); } void update(int i,int x) { while(i<=32001) { c[i]+=x; i+=lowbit(i); } } int getsum(int i) { int sum=0; while(i) { sum+=c[i]; i-=lowbit(i); } return sum; } int main() { int i,s,x,y; while(scanf("%d",&n)!=EOF) { memset(b,0,sizeof(b)); memset(c,0,sizeof(c)); for(i=1;i<=n;i++) { scanf("%d%d",&x,&y); s=getsum(x+1); b[s]++; update(x+1,1); } for(i=0;i<n;i++) { printf("%d\n",b[i]); } } }