E - TOYS

来源 poj 2318

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.

用叉积的方法判断点在向量的左右边就可以了

int direction(point p1,point p2,point p3)//p1是向量起点，p2是终点，p3是判断点，>0则在左边＜0在右侧

{

return (p1.x-p3.x)(p2.y-p3.y)-(p1.y-p3.y)(p2.x-p3.x);

}

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iomanip>
#include<cmath>
#include<float.h>
#include<string.h>
#include<algorithm>
#define sf scanf
#define pf printf
#define mm(x,b) memset((x),(b),sizeof(x))
#include<vector>
#include<queue>
#include<stack>
#include<map>
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=a;i>=n;i--)
typedef long long ll;
typedef long double ld;
typedef double db;
const ll mod=1e9+100;
const db e=exp(1);
const db eps=1e-8;
using namespace std;
const double pi=acos(-1.0);
const int inf=0xfffffff;
struct point
{
	int x,y;
	point(int a=0,int b=0)
	{
		x=a;y=b;
	}
}t;
struct xl
{
	point p1,p2;//p1是下面的点
	int sum;
	xl(int x=0,int y=0,int a=0,int b=0)
	{
		p1=point(x,y);
		p2=point(a,b);sum=0;
	}
}a[5005];
//bool cmp(xl a,xl b)
//{
//	return a.p1.x<b.p1.x;
//}
int direction(point p1,point p2,point p3)//p1是向量起点，p2是终点，p3是判断点，》0则在左边＜0在右侧
{
	return (p1.x-p3.x)*(p2.y-p3.y)-(p1.y-p3.y)*(p2.x-p3.x);
}
int main()
{
	int n,m,X1,X2,Y1,Y2,x,y;
	int jud=1;
	while(1)
	{
		cin>>n;
		if(!n)
		return 0;
		if(!jud)
		pf("\n");
		cin>>m>>X1>>Y1>>X2>>Y2;
		rep(i,0,n)
		{
			cin>>x>>y;
			a[i]=xl(y,Y2,x,Y1);
		}
		a[n]=xl();
	//	sort(a,a+n,cmp);
		while(m--)
		{
			int temp=0;
			cin>>t.x>>t.y;
			rep(i,0,n)
			{
				if(direction(a[i].p1,a[i].p2,t)>0)
				{
					a[i].sum++;temp=1;
					break;
				}
			}
			if(!temp)
			a[n].sum++;
		}
		rep(i,0,n+1)
		{
			pf("%d: %d\n",i,a[i].sum);
		}
		jud=0;
	}
}