poj2318TOYS【二分+点与直线位置判断】

最新推荐文章于 2021-06-08 21:43:56 发布

飞翔的大胖兔子

最新推荐文章于 2021-06-08 21:43:56 发布

阅读量120

点赞数

CC 4.0 BY-SA版权

分类专栏：计算几何

本文链接：https://blog.csdn.net/qq_27151549/article/details/80071166

计算几何专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一种通过算法计算玩具落入玩具箱不同分区的数量的方法。父母利用纸板隔板将玩具箱分隔成多个区域，以便更好地整理孩子的玩具。算法接受隔板坐标及玩具落地坐标作为输入，并输出每个隔间内的玩具数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Language:Default

TOYS

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 12094		Accepted: 5833

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

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

题意：在一个盒子内用挡板隔开给出挡板两端坐标和一些玩具的坐标输出落在每个方格中的玩具数

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
struct point{
	int x,y;
};
struct Node{
	point a,b;
}A[5010];
int pos[5010];
bool judge(int xx,int yy,int mid){
	int ans=(A[mid].a.x-xx)*(A[mid].b.y-yy)-(A[mid].a.y-yy)*(A[mid].b.x-xx);
	if(ans<0)return false;
	return true;
}
void search(int xx,int yy,int n){
	int left=0,right=n-1;
	while(left<=right){
		int mid=(left+right)>>1;
		if(judge(xx,yy,mid)){
			left=mid+1;
		}
		else {
			right=mid-1;
		}
	}
	pos[left]++;
}
int main()
{
	int n,m,i,j,x1,x2,y1,y2;
	while(scanf("%d",&n),n){//while(~scanf("%d%d%d%d%d%d",&n,&m,&x1,&y1,&x2,&y2)&&n!=0){这样写在输入0的时候并不会立即停止
		scanf("%d%d%d%d%d",&m,&x1,&y1,&x2,&y2);
		for(i=0;i<n;++i){
			int xd,xu;
			scanf("%d%d",&xu,&xd);
			A[i].a.x=xu;
			A[i].a.y=y1;
			A[i].b.x=xd;
			A[i].b.y=y2;
		}
		memset(pos,0,sizeof(pos));
		for(i=0;i<m;++i){
			int xx,yy;
			scanf("%d%d",&xx,&yy);
			search(xx,yy,n);
		}
		for(i=0;i<=n;++i){
			printf("%d: %d\n",i,pos[i]);
		}
		printf("\n");
	}
	return 0;
}