POJ 2318 TOYS(叉积+二分查找)
来源:互联网 发布:mint linux 编辑:程序博客网 时间:2024/06/05 19:48
TOYS
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10641 Accepted: 5116
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.
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 03 14 36 810 1015 301 52 12 85 540 107 94 10 0 10 100 020 2040 4060 6080 80 5 1015 1025 1035 1045 1055 1065 1075 1085 1095 100
Sample Output
0: 21: 12: 13: 14: 05: 10: 21: 22: 23: 24: 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 <cstring>using namespace std;struct point{int x,y;};struct line{point s;point e;}l[5005];int n,m,x1,y1,x2,y2;int count[5005];long long kk(int x1,int y1,int x2,int y2){return x1*y2-x2*y1;}int f(int u,int v,int k){int min=0,max=k+1;int mid;for(;;){mid=(max-min)/2+min;if(min==mid)return mid;if(kk(l[mid].e.x-l[mid].s.x,l[mid].e.y-l[mid].s.y,u-l[mid].s.x,v-l[mid].s.y)>0)min=mid;elsemax=mid;//cout<<kk(l[mid].e.x-l[mid].s.x,l[mid].e.y-l[mid].s.y,u-l[mid].s.x,v-l[mid].s.y)<<endl;}}int main(){int n,m,x1,y1,x2,y2;while(cin>>n){if(n==0)return 0;cin>>m>>x1>>y1>>x2>>y2;l[0].s.x=x1;l[0].s.y=y1;l[0].e.x=x1;l[0].e.y=y2;l[n+1].s.x=x2;l[n+1].s.y=y1;l[n+1].e.x=x2;l[n+1].e.y=y2;memset(count,0,sizeof(count));for(int i=1;i<=n;i++){cin>>l[i].s.x>>l[i].e.x;l[i].s.y=y1;l[i].e.y=y2;}int u,v;for(int i=0;i<m;i++){cin>>u>>v;count[f(u,v,n)]++;}for(int i=0;i<=n;i++){cout<<i<<": "<<count[i]<<endl;}cout<<endl;}return 0;}
0 0
- POJ 2318 TOYS(叉积+二分查找)
- Poj 2318 TOYS (叉积+二分)
- POJ 2318 TOYS 二分+叉积
- poj 2318 TOYS 二分+叉积
- poj 2318 TOYS 二分+叉积
- POJ 2318 TOYS(叉积+二分)
- poj 2318 TOYS(叉积+二分)
- poj 2318 TOYS(叉积+二分)
- POJ 2318 TOYS (计算几何,向量积,二分查找)
- POJ 2318 TOYS (判断点与直线关系+二分查找)
- POJ 2318 TOYS [叉积判断+二分查找]【计算几何】
- TOYS (poj 2381 叉积+二分)
- POJ 2318 TOYS 计算几何 入门题 叉积 + 二分
- POJ 2318 TOYS(叉积+二分or暴力)
- POJ 2318 —— TOYS(叉积+二分)
- TOYS - POJ 2318 叉积
- poj 2318 TOYS (叉积)
- poj 2318 TOYS(判断点在多边形内+二分查找)
- 通过PowerShell获取域名whois信息
- Java StringBuilder和StringBuffer的比较
- gdb/lldb 使用
- vs2012设置默认的全局include和lib
- leetcode - Unique Binary Search Trees II
- POJ 2318 TOYS(叉积+二分查找)
- leetcode - Binary Tree Inorder Traversal
- ListView高度设置
- 如何成为一名Top DevOps Engineer
- acdream1242 水BFS
- 新生感悟
- 企业视觉-大型电商(系统)高性能-用户视觉性能(1)
- Python串口功能实现
- 按钮制作技巧(css精灵效果)-高级版