【POJ 2318】TOYS（计算几何）

TOYS

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 13250		Accepted: 6405

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

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<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct point{
	int x,y;
}; 
struct mean{
	point a,b;
}d[5010];
int n,m,ans[5010];

inline point match(point a,point b)
{
	point k;
	k.x=a.x-b.x;
	k.y=a.y-b.y;
	return k;
}将点与边界向量的起点或终点连成向量 
inline int cross(point a,point b)
{
	return a.x*b.y-a.y*b.x;
}//计算叉积 
inline int check(point p1,point p2,point p3)
{
	return cross(match(p2,p1),match(p3,p1));
} 
inline void find(point c)
{
	int l=1,r=n,mid=0,t=0;
	while(l<=r)
	 {
	 	mid=(l+r)>>1;//取当前区间的中点
		if (check(d[mid].a,d[mid].b,c)>=0) //判断点是否在当前区间（若大于零，在顺时针方向）
		  t=mid,l=mid+1;
		 else r=mid-1; 
	 }
	ans[t]++;
	return;
}//二分判断当前点的位置 

int main()
{
	int i,j;
	while((scanf("%d",&n)==1)&&n)
	 {
	    memset(ans,0,sizeof(ans));
	 	int x1,x2,y1,y2;
	 	scanf("%d%d%d%d%d",&m,&x1,&y1,&x2,&y2);
	 	for(i=1;i<=n;++i)
	 	 {
	 	 	int t1,t2;
	 	 	scanf("%d%d",&t1,&t2);
	 	 	d[i].a.x=t1; d[i].a.y=y1;
	 	 	d[i].b.x=t2; d[i].b.y=y2;
	 	 }
	 	point c;
	 	for(i=1;i<=m;++i)
	 	 {
	 	 	int t1,t2;
	 	 	scanf("%d%d",&t1,&t2);
			c.x=t1; c.y=t2;
			find(c); 
	 	 } 
	 	for(i=0;i<=n;++i)
	 	 printf("%d: %d\n",i,ans[i]);
	 	printf("\n");
	 }
	return 0;
}