【POJ 2398】Toy Storage（计算几何）

Toy Storage
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 5091 Accepted: 3019
Description

Mom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with them. They gave Reza a rectangular box to put his toys in. Unfortunately, Reza 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 Reza to find his favorite toys anymore.
Reza’s parents came up with the following idea. They put cardboard partitions into the box. Even if Reza keeps throwing his toys into the box, at least toys that get thrown into different partitions stay separate. The box looks like this from the top:
We want for each positive integer t, such that there exists a partition with t toys, determine how many partitions have t, toys.

Input
The input consists of a number of cases. The first line consists of six integers n, m, x1, y1, x2, y2. The number of cardboards to form the partitions is n (0 < n <= 1000) and the number of toys is given in m (0 < m <= 1000). 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 each consists of two integers Ui Li, indicating that the ends of the ith cardboard is at the coordinates (Ui, y1) and (Li, y2). You may assume that the cardboards do not intersect with each other. The next m lines each consists of two integers Xi Yi specifying where the ith toy has landed in the box. You may assume that no toy will land on a cardboard.
A line consisting of a single 0 terminates the input.

Output
For each box, first provide a header stating “Box” on a line of its own. After that, there will be one line of output per count (t > 0) of toys in a partition. The value t will be followed by a colon and a space, followed the number of partitions containing t toys. Output will be sorted in ascending order of t for each box.

Sample Input
4 10 0 10 100 0
20 20
80 80
60 60
40 40
5 10
15 10
95 10
25 10
65 10
75 10
35 10
45 10
55 10
85 10
5 6 0 10 60 0
4 3
15 30
3 1
6 8
10 10
2 1
2 8
1 5
5 5
40 10
7 9
0

Sample Output
Box
2: 5
Box
1: 4
2: 1

[题意][与POJ 2318相似，只是输出的是每种 区间里出现的点的个数 的情况有多少种]
【题解】【比POJ 2318多了对读入的向量的排序和统计每种出现次数出现的次数】

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct point{
    int x,y;
};
struct cord{
    point a,b;
}d[5010];
int n,m,ans[5010],num[5010];

int tmp(cord t1,cord t2)
{
    return t1.a.x<t2.a.x;
}

inline point match(point p1,point p2)
{
    point t;
    t.x=p1.x-p2.x;
    t.y=p1.y-p2.y;
    return t;
}
inline int cross(point t1,point t2)
{
    return t1.x*t2.y-t1.y*t2.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,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;
     }
    num[t]++;
    return;
}

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