POJ2352
来源:互联网 发布:劳丽诗淘宝店石榴石 编辑:程序博客网 时间:2024/06/08 18:42
Stars
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 31671 Accepted: 13810
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
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
[Submit] [Go Back] [Status] [Discuss
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 31671 Accepted: 13810
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
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
[Submit] [Go Back] [Status] [Discuss
<span style="color:#3333ff;">#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#define MAX 32005using namespace std;int b[3*MAX],n,y,a[3*MAX],tree[3*MAX],m=0;void build(int p,int l,int r,int x){ if(l==r){tree[p]++;return;} int mid=(l+r)*0.5; if(mid>=x) build(p*2,l,mid,x); else build(p*2+1,mid+1,r,x); tree[p]=tree[p*2]+tree[p*2+1];}int find(int p,int l,int r,int x,int y){ if(x<=l&&y>=r) return tree[p]; int mid=(l+r)/2; if(mid>=y) return find(p*2,l,mid,x,y); if(mid<x) return find(p*2+1,mid+1,r,x,y); int t=find(p*2,l,mid,x,y)+find(p*2+1,mid+1,r,x,y); return t;}int main(){ scanf("%d",&n); memset(a,0,sizeof(a)); for(int i=1;i<=n;i++) { scanf("%d%d",&b[i],&y); if(b[i]>m) m=b[i]; } for(int i=1;i<=n;i++) { build(1,0,m,b[i]); a[find(1,0,m,0,b[i])-1]++; } for(int i=0;i<n;i++) printf("%d\n",a[i]); return 0;}</span>
0 0
- POJ2352
- poj2352
- POJ2352
- POJ2352
- poj2352
- poj2352
- POJ2352
- poj2352
- poj2352
- poj2352
- POJ2352
- POJ2352
- poj2352
- Poj2352
- poj2352
- POJ2352
- poj2352
- poj2352 Stars
- 北~京
- leetcode two sum
- GUI程序和CUI程序各自如何获取进程的环境变量
- 科技园颓废太妃糖发一
- 于仁泰一个
- POJ2352
- 反导系统
- 预提费用
- 一周学会Linux实战
- 计算机学院研发第二轮考核---------简述WebViewClient与WebChromeClient,浏览器之无痕浏览
- adc0809的使用
- 杭电acm1282
- JAVA的发展方向以及前辈的一些看法
- drhrtjrjshsjj