Angle Beats

http://acm.hdu.edu.cn/showproblem.php?pid=6731

//#include <iostream>
//#include <cstring>
//#include <queue>
//#include <vector>
//#include <algorithm>
//#include <cstdio>
//#include <set>
//#include <map>
//#include <stack>
#include <tr1/unordered_map>
//#include <unordered_map>
//#include <cmath>
#include<bits/stdc++.h>
using namespace std;

//#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
//#define sfs(i) scanf("%s",(i))
//#define pri(i) printf("%d\n",i)
//#define prl(i) printf("%I64d\n",i)
//#define sff(i) scanf("%lf",&i)
//#define ll long long
//#define ull unsigned long long
//#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
//#define INF 0x3f3f3f3f
//#define inf 8e19
//#define eps 1e-10
//#define PI acos(-1.0)
//#define lowbit(x) ((x)&(-x))
//#define fl() printf("flag\n")
//#define MOD(x) ((x%mod)+mod)%mod
//#define endl '\n'
//#define pb push_back
//#define lson (rt<<1)
//#define rson (rt<<1|1)
//#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=2010;
const int mod=1e9+7;

int n,m;
int ans[maxn];
struct point
{
    int x,y;
    int id;
    point(int _x,int _y)
    {
        x=_x;
        y=_y;
    }
    point(){}
}p[maxn],o,q[maxn],pp[maxn];

point operator - (const point &a,const point &b)
{
    return point(a.x-b.x,a.y-b.y);
}

bool operator^(point &a,point &b)
{
    return (1LL*a.x*b.y-1LL*a.y*b.x)>0;
}
inline int Quadrant(const point& a)//象限,不用inline会tle!!
{
    if(a.x>0 && a.y>=0)return 1;
    else if(a.x<=0 && a.y>0)return 2;
    else if(a.x<0 && a.y<=0)return 3;
    else if(a.x>=0 && a.y<0)return 4;
}

bool operator<(const point &a,const point &b)
{
    point aa=a-o;
    point bb=b-o;
    int qa=Quadrant(aa);
    int qb=Quadrant(bb);
    if(qa!=qb) return qa<qb;
    return aa^bb;
}


int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    while(~scanf("%d%d",&n,&m))
    {
        for(int i=0;i<=m;i++) ans[i]=0;
        for(int i=1;i<=n;i++)
        {
            //scanf("%d%d",&p[i].x,&p[i].y);
            read(p[i].x);
            read(p[i].y);
            pp[i]=p[i];
        }

        for(int i=1;i<=m;i++)
        {
            //scanf("%d%d",&q[i].x,&q[i].y);
            read(q[i].x);
            read(q[i].y);
            o=q[i];
            sort(p+1,p+1+n);
            for(int j=1;j<=n;j++)
            {
                int x=p[j].x-o.x,y=p[j].y-o.y;
                point tmp=point(o.x-y,o.y+x);
                ans[i]+=upper_bound(p+1,p+1+n,tmp)-lower_bound(p+1,p+n+1,tmp);
            }
        }

        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++) p[j]=pp[j];

            o=p[i];
            swap(p[i],p[n]);
            sort(p+1,p+n);
            for(int j=1;j<=m;j++)
            {
                int x=q[j].x-o.x,y=q[j].y-o.y;
                point tmp=point(o.x-y,o.y+x),tmp2=point(o.x+y,o.y-x);
                ans[j]+=upper_bound(p+1,p+n,tmp)-lower_bound(p+1,p+n,tmp);
                ans[j]+=upper_bound(p+1,p+n,tmp2)-lower_bound(p+1,p+n,tmp2);
            }
        }
        for(int i=1;i<=m;i++)
        {
            printf("%d\n",ans[i]);
        }

    }

    return 0;
}