POJ_2352_Stars
来源:互联网 发布:数据库图书管理系统 编辑:程序博客网 时间:2024/06/05 06:06
Stars
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 37221 Accepted: 16231
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
51 15 17 1
3 35 5Sample Output
12110Hint
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
典型的树状数组
由于按照顺序输入
所以,也方便更新
特别注意lowbit(0)=0 add(0,v)的时候
会无穷无尽的循环下去……所以会TLE……
#include <iostream>#include <stdio.h>using namespace std;const int M=32005;int tree[M]; //之前行到t位置的和int level[M];inline int lowbit(int x){ return x&(-x);}void add(int x,int v){ for(int i=x;i<M;i+=lowbit(i)) //主要是这个地方,出现0会会一直循环…… tree[i]+=v;}int getsum(int x){ int s=0; for(int i=x;i;i-=lowbit(i)) s+=tree[i]; return s;}int main(){ int n; int xn,yn; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d%d",&xn,&yn); xn++; //往后挪是为了防止lowbit0 level[getsum(xn)]++; //cout<<"1"; add(xn,1); } for(int i=0;i<n;i++) printf("%d\n",level[i]); return 0;}
0 0
- POJ_2352_Stars
- POJ_2352_Stars
- Ubuntu 学习笔记
- poj 2002 正方形个数 (对点的hash 存储)
- 中文乱码辨识
- intellij idea 修改背景保护色&&修改字体&&快捷键大全
- Windows/Linux远程桌面
- POJ_2352_Stars
- UI018---UITableView使用
- PBOC交易过程详解
- delphi之模拟点击网页中的按钮
- HDOJ1394 Minimum Inversion Number(线段树)
- 命名管道客户端及服务器端简单代码示例
- UI019---ITableviewcell的性能问题和缓存优化
- 搜索引擎之路(一)--- 《搜索引擎---信息检索实践》(读书笔记)
- POJ_1470_ClosestCommonAncestors