TOYS
Time Limit: 2000MS | Memory Limit: 65536K | |
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.
![](https://i-blog.csdnimg.cn/blog_migrate/b881c911dee4ea005b86bfade3fc9423.jpeg)
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.
题意:给你n个排好序的挡板,m个坐标,矩阵的左上角和右下角,求出n+1个区域每个区域有多少个点。
题解:因为挡板是排好序的,所以我们对于每个点for过去,找出第一个在它右侧的挡板即可,如果n更大可以用二分
。
ps:这道题给出了边界,所以不用考虑挡板是线段的问题
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
#define eps 0.00000001
struct node{
double up,down;
}es[5005];
double x1,x2;
double ys,yy;
int num[5005];
bool solve(node a,double x,double y){
double xs=a.up,xx=a.down;
if((xx-xs)*(y-ys)-(yy-ys)*(x-xs)<0)return true;
else return false;
}
//x0 y0是点的坐标 x1 y1 x2 y2是线段的两个端点
//(x2-x1)(y0-y1) – (y2-y1)(x0-x1) > 0 直线在点左侧
//(x2-x1)(y0-y1) – (y2-y1)(x0-x1) < 0 右侧
//(x2-x1)(y0-y1) – (y2-y1)(x0-x1) = 0 线段上
int main(){
int n,m,flag=1;
while(scanf("%d",&n)&&n){
if(!flag)printf("\n");
scanf("%d",&m);
scanf("%lf%lf%lf%lf",&x1,&ys,&x2,&yy);
int i,j;
for(i=1;i<=n;i++)scanf("%lf%lf",&es[i].up,&es[i].down);
memset(num,0,sizeof(num));
double x,y;
for(i=1;i<=m;i++){
scanf("%lf%lf",&x,&y);
for(j=1;j<=n;j++){
if(solve(es[j],x,y)){
num[j-1]++;
break;
}
}
if(j==n+1)num[j-1]++;
}
for(i=0;i<=n;i++){
printf("%d: %d\n",i,num[i]);
}
flag=0;
}
return 0;
}