POJ 2318 TOYS

为毛比一年前的代码跑得还慢，难道是头文件的问题……囧……

#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>

#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <memory>
#include <complex>
#include <numeric>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <ctype.h>
#include <locale.h>

using namespace std;

#pragma pack(4)

const double  eps = 1e-8;
const double   pi = acos(-1.0);
const int     inf = 0x7f7f7f7f;

#define loop(a,n)                            \
    for(int i=0;n>i;i++)                     \
        cout<<a[i]<<(i!=n-1?' ':'\n')
#define loop2(a,n,m)                         \
    for(int i=0;n>i;i++)                     \
        for(int j=0;m>j;j++)                 \
            cout<<a[i][j]<<(j!=m-1?' ':'\n')

#define   at(a,i) ((a)&(1<<(i)))
#define   nt(a,i) ((a)^(1<<(i)))
#define set1(a,i) ((a)|(1<<(i)))
#define set0(a,i) ((a)&(~(1<<(i))))

#define cmp(a,b) (fabs((a)-(b))<eps?0:(((a)-(b))>eps?+1:-1))

#define lmax(a,b) ((a)>(b)?(a):(b))
#define lmin(a,b) ((a)<(b)?(a):(b))
#define fmax(a,b) (cmp(a,b)>0?(a):(b))
#define fmin(a,b) (cmp(a,b)<0?(a):(b))

const int MAXV = 5002;

typedef struct Point
{
    double c[2];
    Point(double a=0,double b=0)
    {
        c[0]=a;
        c[1]=b;
    }
    double & operator [] (int i)
    {
        return c[i];
    }
    Point operator - (Point argu)
    {
        return Point(c[0]-argu[0],c[1]-argu[1]);
    }
}Vector;

double cross(Vector a,Vector b)
{
    return a[0]*b[1]-a[1]*b[0];
}
double cross(Point o,Point a,Point b)
{
    return cross(a-o,b-o);
}

int side(Point p,Point s,Point e)
{
    return cmp(cross(s,e,p),0);
}

int n,m,cnt=0,ans[MAXV];
double xx,yy,ly,uy,lx[MAXV],ux[MAXV];

int bin(Point p,int l,int r)
{
    int mid,ans;
    while(l<=r)
    {
        mid=(l+r)/2;
        if(side(p,Point(lx[mid],ly),Point(ux[mid],uy))<0)
            l=(ans=mid)+1;
        else
            r=mid-1;
    }
    return ans;
}

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("TOYS.txt","r",stdin);
    #endif

    while(scanf("%d",&n),n)
    {
        scanf("%d %lf %lf %lf %lf",&m,&ux[0],&uy,&lx[0],&ly);
        lx[0]=ux[0];
        for(int i=1;n>=i;i++)
        {
            scanf("%lf %lf",&ux[i],&lx[i]);
        }
        memset(ans,0,sizeof(ans));
        for(int i=1;m>=i;i++)
        {
            scanf("%lf %lf",&xx,&yy);
            ans[bin(Point(xx,yy),0,n)]++;
        }
        if(cnt++) printf("\n");
        for(int i=0;n>=i;i++)
        {
            printf("%d: %d\n",i,ans[i]);
        }
    }

    return 0;
}