poj 2318 TOYS

题目：TOYS

//根据叉积判断toy恰好仅在某个隔板的右侧
//比较简单，隔板都是排好序的，所以只需要依次比较
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
struct point
{
    double x,y;
};
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];
bool is_ok(int tmp,int cnt)
{
    if(xmulti(toy[tmp],p[cnt],q[cnt])>0)
        return true;
    return false;
}
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;
        }
        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]++;
        }
        for(int i=0;i<=m;i++)
            printf("%d: %d\n",i,a[i]);
        printf("\n");
    }
    return 0;
}