POJ 2318 TOYS（计算几何）

TOYS

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

ample 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.

题意
给出一个矩形的左上角和右下角的点，然后给出$n$个$u_i,l_i$分别代表分割矩形用的直线的两个坐标点$(u_i,y_1),(l_i,y_2)$（直线从左到右按顺序给出）。然后给出$m$个点（保证一定在这$n+1$个空间内），求各个空间落得的点的个数

题解
几何。
利用叉积求得点在直线的左侧还是右侧（题中保证点不在线上），因为给出的线不相交且从左到右按顺序给出，二分答案记录即可。

代码

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <cmath>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <cmath>
#include <vector>

//#include <bits/stdc++.h>
using namespace std;
#define me(x,y) memset(x,y,sizeof x)
#define MIN(x,y) x < y ? x : y
#define MAX(x,y) x > y ? x : y
typedef long long ll;
const int maxn = 5050;
const int INF = 0x3f3f3f3f;
const int MOD = 1e4;
const int eps = 1e-11;
const double PI = acos(-1.0);

int sgn(double x){
    if(fabs(x) < eps) return 0;
    if(x < 0)return -1;
    else return 1;
}

inline double sqr(double x){return x*x;}

struct Point{
    double x,y;
    Point(){}
    Point(double _x,double _y){x = _x,y = _y;}
    void input(){scanf("%lf%lf",&x,&y);}
    void output(){printf("%.2f %.2f\n",x,y);}
    bool operator == (Point b)const{return sgn(x-b.x) == 0 && sgn(y-b.y) == 0;}
    bool operator < (Point b)const{return sgn(x-b.x) == 0 ? sgn(y-b.y)<0 : x<b.x;}
    Point operator -(const Point &b)const{return Point(x-b.x,y-b.y);}
    double operator ^ (const Point &b)const{return x*b.y-y*b.x;}    //叉积
    double operator * (const Point &b)const{return x*b.x+y*b.y;}    //点积
    double len(){return hypot(x,y);}                                //返回长度
    double len2(){return x*2+y*y;}                                  //返回长度平方
    double distance(Point p){return hypot(x-p.x,y-p.y);}            //返回两点间距离
    Point operator + (const Point &b)const{return Point(x+b.x,y+b.y);}//
    Point operator * (const double &k)const{return Point(x*k,y*k);} //
    Point operator / (const double &k)const{return Point(x/k,y/k);} //

};

struct Line{
    Point s,e;
    Line(){}
    Line(Point _s,Point _e){s = _s;e = _e;}
    bool operator == (Line v){return (s == v.s) && (e == v.e);}
    int relation(Point p){                                          //点和直线的关系，1在左侧，2在右侧，3在直线上
        int c = sgn((p-s)^(e-s));
        if(c < 0)return 1;
        else if(c > 0) return 2;
        else return 3;
    }
};

int main(){
    int n,m;
    double x1,x2,y1,y2;
    while(cin>>n && n){
        cin>>m>>x1>>y1>>x2>>y2;
        int x[maxn];
        me(x,0);
        Line li[maxn];
        for(int i = 0; i < n; ++i){
            double u,l;
            scanf("%lf%lf",&u,&l);
            li[i].e = {u,y1};
            li[i].s = {l,y2};
        }
        Point po[maxn];
        for(int i = 0; i < m; ++i){
            scanf("%lf%lf",&po[i].x,&po[i].y);
            if(li[0].relation(po[i]) == 1){
                x[0]++;
                continue;
            }
            if(li[n-1].relation(po[i]) == 2){
                x[n]++;
                continue;
            }
            int l = 1,r = n-1;
            while(l <= r){
                int mid = (l+r)>>1;
                if(li[mid].relation(po[i]) == 1 && li[mid-1].relation(po[i]) == 1){
                     r = mid-1;
                }
                else if (li[mid].relation(po[i]) == 2 && li[mid-1].relation(po[i]) == 2){
                    l = mid+1;
                }
                else{
                    x[mid]++;
                    break;
                }
            }
        }
        for(int i = 0; i <= n; ++i){
            printf("%d: %d\n",i,x[i]);
        }
        cout<<endl;
    }
    return 0;
}

/*

*/