[POJ2318]TOYS

 1 #include<map>
 2 #include<set>
 3 #include<deque>
 4 #include<cmath>
 5 #include<queue>
 6 #include<stack>
 7 #include<vector>
 8 #include<cstdio>
 9 #include<complex>
10 #include<cstring>
11 #include<cstdlib>
12 #include<iostream>
13 #include<algorithm>
14 #define maxx 5010
15 #define RG register
16 #define LL long long
17 #define db double
18 using namespace std;
19 int cnt[maxx];
20 struct point{
21   int x,y;
22   point() {}
23   point (int _x,int _y): x(_x),y(_y) {}
24   point operator -(const point a) const{
25     return point(x-a.x,y-a.y);
26   }
27   int operator *(const point a) const {
28     return x*a.x+y*a.y;
29   }
30   int operator ^(const point a) const {
31     return x*a.y-y*a.x;
32   }
33 }a[maxx];
34 int n,m,L,U,loop[maxx];
35 int main(){
36   int x,y,xx,yy;
37   while(scanf("%d",&n)&&n){memset(cnt,0,sizeof(cnt));
38     scanf("%d%d%d%d%d",&m,&x,&y,&xx,&yy);
39     a[0]=a[n+1]=point(0,y-yy);loop[0]=x,loop[n+1]=xx;
40     for(int i=1;i<=n;++i){
41       scanf("%d%d",&U,&L);
42       a[i]=point(U-L,y-yy);
43       loop[i]=L;
44     }
45     point aa;
46     for(int i=1;i<=m;++i){
47       scanf("%d%d",&x,&y);
48       int l=0,r=n+1;
49       while(l<=r){
50     int d=(l+r)>>1;aa=point(x-loop[d],y-yy);
51     if((aa^a[d])<0)r=d-1;
52     else l=d+1;
53       }cnt[l-1]++;
54     }
55     for(int i=0;i<=n;++i)
56       cout<<i<<": "<<cnt[i]<<‘\n‘;
57     cout<<‘\n‘;
58   }
59   return 0;
60 }