Stars
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 48752 | Accepted: 21066 |
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.
![](https://i-blog.csdnimg.cn/blog_migrate/fd47938575a43734c7155490c64a749e.jpeg)
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
在一个星星左下方(包括正左方和正下方)星星的个数为此星星的等级,给出星星坐标(按y坐标升序如果y相同按x升序),求出每个等级对应的星星个数
数状数组典型应用,y坐标是排序的只看x坐标就好,对于一个x坐标xi,sum(xi)就是小于等于他x坐标的星星个数也就是他的等级,
代码:
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<queue>
#include<cstring>
#include<map>
using namespace std;
typedef long long ll;
#define pi acos(-1.0)
#define inf 0x3f3f3f
#define M 32100
int n,m,maxn;
int tree[M],cnt[M/2];
int lowbit(int i)
{
return i&(-i);
}
void add(int i)
{
while(i<=M) //x的值可能达到32000
{
tree[i]+=1;
i+=lowbit(i);
}
}
int sum(int i) //一定注意i>=1,切记i不能为0
{
int res=0;
while(i>0)
{
res+=tree[i];
i-=lowbit(i);
}
return res;
}
int main()
{
int i,x,y;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d",&x,&y);
x++; //避免x=0
cnt[sum(x)]++;
add(x);
}
for(i=0;i<n;i++)
{
printf("%d\n",cnt[i]);
}
return 0;
}