TOYS POJ - 2318（计算几何判断点和直线位置+二分）

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.

题意：

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

分析：

判断点在直线的左侧还是右侧可以用叉积的正负号来判断

如图可知道如果点在直线的左侧，那么叉积的符号应该是负的，反之如果在直线的右侧，符号应该是正的（右手法则，注意向小于180°的方向转）

因此对于每输入的一个点，可以二分找到它所属于的位置

code：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 5100;
struct Point{
    int x,y;
    Point(){}
    Point(int xx,int yy):x(xx),y(yy){}
};
struct Card{
    Point up,down;
    Card(){}
    Card(int x1,int y1,int x2,int y2){
        up = Point(x1,y1);
        down = Point(x2,y2);
    }
}c[maxn];
int n,m,x1,y1,x2,y2;
int pos[maxn];
bool judge(int x,int y,int mid){
    int ans = (c[mid].up.x-x) * (c[mid].down.y-y) - (c[mid].down.x-x) * (c[mid].up.y-y);
    if(ans < 0) return false;//在线左侧
    return true;//在线右侧
}
void search(int x,int y){
    int l = 0,r = n - 1;
    while(l <= r){
        int mid = l + r >> 1;
        if(judge(x,y,mid))//点在线的右侧，找右区间
            l = mid + 1;
        else{//点在左侧找左区间
            r = mid - 1;
        }
    }
    pos[l]++;
}
int main(){
    while(~scanf("%d",&n) && n){
        scanf("%d%d%d%d%d",&m,&x1,&y1,&x2,&y2); 
        for(int i = 0; i < n; i++){
            int u,l;
            scanf("%d%d",&u,&l);
            c[i] = Card(u,y1,l,y2);
        }
        memset(pos,0,sizeof(pos));
        for(int i = 0; i < m; i++){
            int x,y;
            scanf("%d%d",&x,&y);
            search(x,y);
        }
        for(int i = 0; i <= n; i++){
            printf("%d: %d\n",i,pos[i]);
        }
        printf("\n");
    }
    return 0;
}