Poj 2318 TOYS

TOYS

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 17117		Accepted: 8175

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

1. Sample Output

0: 2
1: 1
2: 1
3: 1
4: 0
5: 1

0: 2
1: 2
2: 2
3: 2
4: 2

• 这个题目用到的是叉积与二分搜索，重点考察的是叉积的几何意义，假设有三点p0（x0,y0）,p1（x1,y1）,p2（x2,y2）,组成了两个向量p0p1和p0p2;这个题目用到的是判断p0要在p1p2的左边,通过计算（p1-p0）*（p2-p0）=（x1-x0）*（y2-y0）-（x2-x0）*（y1-y0）;如果结果大于0，说明向量p0p1在向量p0p2的顺时针方向,如果小于0，说明在逆时针方向，最后如果等于0，说明在同一条直线上。
• 
  

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define M 5001
struct point{
    int x,y;
};
struct line{
    point a,b;
}P[M];
int pos[M];
bool check(int xx,int yy,int mid){
/*叉积判断，如果结果大于0，说明是在顺时针方向，即右边；
否则在逆时针方向，即左边。这是叉积代表的几何意义之一*/
    int ans=(P[mid].a.x-xx)*(P[mid].b.y-yy)-(P[mid].a.y-yy)*(P[mid].b.x-xx);
    if (ans>0)
        return true;
    return false;
}
void binarySearch(int xx,int yy,int n){
    int left=0,right=n-1,mid;
    while (left<=right)
    {
        mid=(left+right)/2;
        if (check(xx,yy,mid)){      //叉积理解的关键
            left=mid+1;
        }else{
            right=mid-1;
        }
    }
    pos[left]++;
}
int main()
{
    int n,m,x1,x2,y1,y2;
    while (scanf("%d",&n),n){
        scanf("%d%d%d%d%d",&m,&x1,&y1,&x2,&y2);
        for (int i=0;i<n;i++){
            int ui,li;
            scanf("%d%d",&ui,&li);
            P[i].a.x=ui;
            P[i].a.y=y1;
            P[i].b.x=li;
            P[i].b.y=y2;
        }
        memset(pos,0,sizeof(pos));
        for (int i=0;i<m;i++){
            int xx,yy;
            scanf("%d%d",&xx,&yy);
            binarySearch(xx,yy,n);
        }
        for (int i=0;i<=n;i++){
            printf("%d: %d\n",i,pos[i]);
        }
        printf("\n");
    }
    return 0;
}