POJ 2318 TOYS
2013-10-29 22:25
405 查看
TOYS
Description
Calculate the number of toys that land in each bin of a partitioned toy box.
Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. They gave John a rectangular box to put his toys in, but John is rebellious and obeys his parents by simply throwing his toys into the box. All the toys get mixed up, and it is impossible for John to find his favorite toys.
John's parents came up with the following idea. They put cardboard partitions into the box. Even if John keeps throwing his toys into the box, at least toys that get thrown into different bins stay separated. The following diagram shows a top view of an example toy box.
For this problem, you are asked to determine how many toys fall into each partition as John throws them into the toy box.
Input
The input file contains one or more problems. The first line of a problem consists of six integers, n m x1 y1 x2 y2. The number of cardboard partitions is n (0 < n <= 5000) and the number of toys is m (0 < m <= 5000). The coordinates of the upper-left corner and the lower-right corner of the box are (x1,y1) and (x2,y2), respectively. The following n lines contain two integers per line, Ui Li, indicating that the ends of the i-th cardboard partition is at the coordinates (Ui,y1) and (Li,y2). You may assume that the cardboard partitions do not intersect each other and that they are specified in sorted order from left to right. The next m lines contain two integers per line, Xj Yj specifying where the j-th toy has landed in the box. The order of the toy locations is random. You may assume that no toy will land exactly on a cardboard partition or outside the boundary of the box. The input is terminated by a line consisting of a single 0.
Output
The output for each problem will be one line for each separate bin in the toy box. For each bin, print its bin number, followed by a colon and one space, followed by the number of toys thrown into that bin. Bins are numbered from 0 (the leftmost bin) to n (the rightmost bin). Separate the output of different problems by a single blank line.
Sample Input
Sample Output
Hint
As the example illustrates, toys that fall on the boundary of the box are "in" the box.
Source
Rocky Mountain 2003
解题思路:利用叉积判断点在线段的左右位置,进而用二分判断点在哪个盒子里,统计下即可。
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 9310 | Accepted: 4436 |
Calculate the number of toys that land in each bin of a partitioned toy box.
Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. They gave John a rectangular box to put his toys in, but John is rebellious and obeys his parents by simply throwing his toys into the box. All the toys get mixed up, and it is impossible for John to find his favorite toys.
John's parents came up with the following idea. They put cardboard partitions into the box. Even if John keeps throwing his toys into the box, at least toys that get thrown into different bins stay separated. The following diagram shows a top view of an example toy box.
For this problem, you are asked to determine how many toys fall into each partition as John throws them into the toy box.
Input
The input file contains one or more problems. The first line of a problem consists of six integers, n m x1 y1 x2 y2. The number of cardboard partitions is n (0 < n <= 5000) and the number of toys is m (0 < m <= 5000). The coordinates of the upper-left corner and the lower-right corner of the box are (x1,y1) and (x2,y2), respectively. The following n lines contain two integers per line, Ui Li, indicating that the ends of the i-th cardboard partition is at the coordinates (Ui,y1) and (Li,y2). You may assume that the cardboard partitions do not intersect each other and that they are specified in sorted order from left to right. The next m lines contain two integers per line, Xj Yj specifying where the j-th toy has landed in the box. The order of the toy locations is random. You may assume that no toy will land exactly on a cardboard partition or outside the boundary of the box. The input is terminated by a line consisting of a single 0.
Output
The output for each problem will be one line for each separate bin in the toy box. For each bin, print its bin number, followed by a colon and one space, followed by the number of toys thrown into that bin. Bins are numbered from 0 (the leftmost bin) to n (the rightmost bin). Separate the output of different problems by a single blank line.
Sample Input
5 6 0 10 60 0 3 1 4 3 6 8 10 10 15 30 1 5 2 1 2 8 5 5 40 10 7 9 4 10 0 10 100 0 20 20 40 40 60 60 80 80 5 10 15 10 25 10 35 10 45 10 55 10 65 10 75 10 85 10 95 10 0
Sample Output
0: 2 1: 1 2: 1 3: 1 4: 0 5: 1 0: 2 1: 2 2: 2 3: 2 4: 2
Hint
As the example illustrates, toys that fall on the boundary of the box are "in" the box.
Source
Rocky Mountain 2003
解题思路:利用叉积判断点在线段的左右位置,进而用二分判断点在哪个盒子里,统计下即可。
#include<iostream> #include<cstdio> #include<cstring> #define Max 5005 using namespace std; struct Point { int x; int y; }point[Max]; struct Line { Point a; Point b; }line[Max]; inline double mul(Point p0,Point p1,Point p2) { return((p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y)); } int search(int x,int y,int lim) { int l=0;int r=lim; int ans=lim; Point O; O.x=x;O.y=y; while(r>=l) { int m=(l+r)>>1; if(mul(O,line[m].a,line[m].b)>0) l=m+1; else { ans=m; r=m-1; } } return ans; } int main() { int i,m,n,x1,x2,y1,y2,ans[Max]; while(scanf("%d",&n),n) { memset(ans,0,sizeof(ans)); scanf("%d%d%d%d%d",&m,&x1,&y1,&x2,&y2); for(i=0;i<n;i++) { scanf("%d%d",&line[i].a.x,&line[i].b.x); line[i].a.y=y1;line[i].b.y=y2; } for(i=0;i<m;i++) { scanf("%d%d",&point[i].x,&point[i].y); int num=search(point[i].x,point[i].y,n); ans[num]++; } for (i = 0; i <= n; i++) printf ("%d: %d\n", i, ans[i]); printf("\n"); } return 0; }
相关文章推荐
- 多mysql实例下开发需要注意主从同步延迟
- Lucene教程(三)- 理解搜索过程的核心类
- C++ 指针和引用的区别
- Strict Weak Ordering
- Gherkin学习笔记
- 框架模式和设计模式的区别
- (字符串的处理4.7.22)POJ 3337 Expression Evaluator(解析C风格的字符串)
- 我快成为了我一直讨厌的那种人(说好的回来好好做人呢?)
- Android监听WIFI网络的变化并且获得当前信号强度
- 关于free使用注意
- Bash Shell中命令行选项/参数处理
- linux配置java环境变量64位
- linux菜鸟(me)的一周计划
- C语言学习笔记
- Havana中VM的reboot分析
- iOS开发-UIWebView
- android中得到所有安装的应用程序及区分其是否为系统应用程序还是用户应用程序
- 在A*寻路中使用二叉堆
- hdu 4284 Travel(壮压DP&TSP&floyd)
- 分享一组Rpg Marker人物行走,游戏素材图片,共20张图片