USTC 1121 Herbal Medicine on Diaoyu Islands

Herbal Medicine on Diaoyu Islands

Time Limit: 1000ms
Memory Limit: 65536kb

Description

Diaoyu Islands were, are and will always be an inalienable part of Chinese territory.

In 1372, a Chinese named Yang Tsai landed on Diaoyu Islands for the first time. There was a detailed record about Diaoyu Islands in a book titled Sail with the Wind, a navigation guidebook published during the reign of Emperor Yongle of Ming Dynasty.

As we know, the Empress Dowager Cixi of Qing Dynasty attended to state affairs for several decades. One day Cixi was very satisfied with the medicine presented by Sheng Xuanhuai and she learnt that the ingredients of the medicine came from Diaoyu Islands. In the tenth month of the nineteenth year of Guangxu's reign, Cixi bestowed Diaoyu Islands to Sheng Xuanhuai to gather medicine ingredients.

One of my friends also grows two kinds of Chinese herbal medicine that grow on Diaoyu Islands, Species A and Species B. He planted a small hedge in his garden for he hadn’t found enough branches. He grows all Species A plants inside the hedge, and each Species A plant values two. Meanwhile, he grows all Species B plants outside the hedge, and each Species B plant values one. The hedge shape is a convex polygon.

You are expected to work out a program to calculate the total value of all the plants inside and outside the hedge.

Input

The input contains multiple test cases.

The first line of each test case contains two integers n and m. n (3 <= n <= 50) is the number of vertices of the convex polygon hedge. m (0 <= m <= 10000) is the number of vertices representing all the plants. This is followed by n lines. Each of the n lines contains a pair of integers representing the coordinates of the vertices of the polygon. The vertices are listed in clockwise order. Each of the following m lines contains a pair of integer coordinates describing the location of the every plant. It is guaranteed that no two plants locate in the same place and no plant locates on the boundary of the hedge.

The input is terminated with a single line containing two zeros.

Output

Print a single line containing the total value of all the plants for each test case.

Sample Input

4 2
4 5
5 2
2 1
1 3
6 3
2 2
0 0

Sample Output

3

来源：34th ACM/ICPC Asia Regional, Hefei, Preliminary

解题：
       题目要判断点是否在凸多边形内，给我们的数据先是一个顺时针的凸多边形，而后给我们一些点让我们判断。套用模板直接过的。
#include <iostream>
#include <cmath> 
using namespace std;

/* 常用的常量定义 */ 
const double    INF        = 1E200  ;  
const double    EP        = 1E-10 ;
const int        MAXV    = 300 ;
const double    PI        = 3.14159265 ;

/* 基本几何结构 */ 
struct POINT 
{ 
    double x; 
    double y; 
    POINT(double a=0, double b=0) { x=a; y=b;} //constructor 
}; 
struct LINESEG 
{ 
    POINT s; 
    POINT e; 
    LINESEG(POINT a, POINT b) { s=a; e=b;} 
    LINESEG() { } 
}; 
struct LINE           // 直线的解析方程 a*x+b*y+c=0  为统一表示，约定 a >= 0 
{ 
    double a; 
    double b; 
    double c; 
    LINE(double d1=1, double d2=-1, double d3=0) {a=d1; b=d2; c=d3;} 
}; 
double multiply(POINT sp,POINT ep,POINT op) 
{ 
    return((sp.x-op.x)*(ep.y-op.y)-(ep.x-op.x)*(sp.y-op.y)); 
} 
bool InsideConvexPolygon(int vcount,POINT polygon[],POINT q) // 可用于三角形！ 
{ 
    POINT p; 
    LINESEG l; 
    int i; 
    p.x=0;p.y=0; 
    for(i=0;i<vcount;i++) // 寻找一个肯定在多边形polygon内的点p：多边形顶点平均值 
    { 
        p.x+=polygon[i].x; 
        p.y+=polygon[i].y; 
    } 
    p.x /= vcount; 
    p.y /= vcount; 

    for(i=0;i<vcount;i++) 
    { 
        l.s=polygon[i];l.e=polygon[(i+1)%vcount]; 
        if(multiply(p,l.e,l.s)*multiply(q,l.e,l.s)<0) /* 点p和点q在边l的两侧，说明点q肯定在多边形外 */ 
        break; 
    } 
    return (i==vcount); 
} 

int main()
{
    int n,m,sum,i;
    POINT aPoint;
    POINT polygon[51];
    while (cin>>n>>m && n!=0 && m!=0)
    {
        sum=0;
        for (i=0;i<n;i++)
        {
            cin>>polygon[i].x>>polygon[i].y;
        }
        for (i=0;i<m;i++)
        {
            cin>>aPoint.x>>aPoint.y;
            if (InsideConvexPolygon(n,polygon,aPoint))
            {
                sum+=2;
            }
            else
            {
                sum++;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}