poj 2318 Toys

题目链接：点击打开链接

题目大意：把玩具放在格子里面，看每个格里面有多少玩具

题目分析：基础入门题目，注意叉积和规范写法

自己写的代码，欢迎斧正

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
struct point{
int x,y;
  point(int a=0,int b=0)
  {
      x=a;y=b;
  }
}part[10020],u_left,l_right,node[5005];
int ans[5005];
int cross(point p0,point p1,point p2)
{
  return ((p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y));

}
int n,m;
int cmp(point a,point b)
{
    return a.x<b.x;
}
void solve()
{
    int j=0;
    for(int i=0;i<m;i++)
    {
        for(j=0;j<=2*n;)
        {

           if(cross(part[j+1],node[i],part[j])>0&&cross(part[j+3],part[j+2],node[i])>0)
           {
              ans[j/2]++;break;
           }
           else j+=2;

        }
    }
}
int main()
{
    while(~scanf("%d%d%d%d%d%d",&n,&m,&u_left.x,&u_left.y,&(l_right.x),&(l_right.y))&&n)
    {
        int u,l;
        part[0].x=u_left.x, part[0].y=u_left.y;
        part[1].x=u_left.x, part[1].y=l_right.y;
        for(int i=2;i<=2*n;i+=2)
        {
             scanf("%d %d",&u,&l);
             part[i].x=u , part[i].y=u_left.y;
             part[i+1].x=l , part[i+1].y=l_right.y;
        }
        part[2*n+2].x=l_right.x , part[2*n+2].y=u_left.y;
        part[2*n+3].x=l_right.x , part[2*n+3].x=l_right.x;
        for(int j=0;j<m;j++)
        {
            scanf("%d %d",&node[j].x,&node[j].y);
        }
        memset(ans,0,sizeof(ans));
        solve();
        for(int i=0;i<=n;i++)
        {
            printf("%d: %d\n",i,ans[i]);
        }
        printf("\n");
    }
    return 0;
}