poj 2398 Toy Storage

题目：Toy Storage

// poj2318 的变形
// 需要自己给隔板排序
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
struct point
{
    double x,y;
};
struct line
{
    point sp,ep;
};
line l[5005];
double xmulti(point p1,point p2,point p0)
{
    return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
point p[5005],q[5005],toy[5005];
int m,n;
int a[5005],b[5005];
bool is_ok(int tmp,int cnt)
{
    if(xmulti(toy[tmp],l[cnt].sp,l[cnt].ep)>0)
        return true;
    return false;
}
bool cmp(line l1,line l2)
{
    return min(l1.sp.x,l1.ep.x)<min(l2.sp.x,l2.ep.x);
}
int main()
{
    while(scanf("%d",&m),m!=0)
    {
        scanf("%d",&n);
        scanf("%lf%lf%lf%lf",&p[0].x,&p[0].y,&q[m+1].x,&q[m+1].y);
        p[m+1].y=p[0].y,p[m+1].x=q[m+1].x;
        q[0].x=p[0].x,q[0].y=q[m+1].y;
        for(int i=1;i<=m;i++)
        {
            scanf("%lf%lf",&p[i].x,&q[i].x);
            p[i].y=p[0].y;
            q[i].y=q[m+1].y;
        }
        for(int i=0;i<=m+1;i++)
        {
            l[i].sp=p[i];
            l[i].ep=q[i];
        }
        sort(l,l+m+2,cmp);
        memset(a,0,sizeof(a));
        for(int i=1;i<=n;i++)
            scanf("%lf%lf",&toy[i].x,&toy[i].y);
        for(int i=1;i<=n;i++)
        {
            int l=0,r=m+1,ans;
            while(l<=r)
            {
                int mid=(l+r)/2;
                if(is_ok(i,mid))
                {
                    ans=mid;
                    l=mid+1;
                }
                else
                    r=mid-1;
            }
            a[ans]++;
        }
        memset(b,0,sizeof(b));
        for(int i=0;i<=m;i++)
            b[a[i]]++;
        printf("Box\n");
        for(int i=1;i<=1000;i++)
            if(b[i])
                printf("%d: %d\n",i,b[i]);
    }
    return 0;
}