Stars
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 46750 | Accepted: 20155 |
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.
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
Ural Collegiate Programming Contest 1999
题意:给出一些星星的坐标,求每个星星左方,下方,左下方的星星个数,并根据个数分等级(0~n-1),输出每个等级有多少个星星。
题解:题目坐标以Y坐标从小到大,X从小到大排序,所以采用以x坐标为基准,建立下标为x的sum树状数组,所以该星星对应的等级就是目前统计0~x对应的星星数目总和,再对sum[x]及其以后的数据进行维护。
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int sum[32005],lev[15005],n;
int lowbit(int x){
return x&(-x);
}
void updata(int x){
while(x<=32005){
sum[x]++;
x+=lowbit(x);
}
}
int getSum(int x){
int s=0;
while(x>0){
s+=sum[x];
x-=lowbit(x);
}
return s;
}
int main(){
//freopen("in.txt","r",stdin);
while(scanf("%d",&n)!=EOF){
memset(sum,0,sizeof(sum));
memset(lev,0,sizeof(lev));
for(int x,y,i=1;i<=n;i++){
scanf("%d%d",&x,&y);
x++;
lev[getSum(x)]++;
updata(x);
}
for(int i=0;i<n;i++) printf("%d\n",lev[i]);
}
}