UVA 10065 Useless Tile Packers(凸包面积)

UVA 10065 Useless Tile Packers(凸包面积)

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1006

题意:

       按时针顺序给你一个n个顶点的多边形(可能为凹多边形)的每个点,然后你要求出多少形的面积s1,以及多边形凸包的面积s2. 你要输出(s2-s1)/s2的百分比,保留两位小数.所给的多边形不会出现3点共线的情况.

分析:

       题意明确,先求原多边形面积,然后再求凸包的面积即可. 两个做差求百分比即可. 用的都是刘汝佳的模板.

AC代码:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const double eps=1e-10;
int dcmp(double x)
{
    if(fabs(x)<eps) return 0;
    return x<0?-1:1;
}
struct Point
{
    double x,y;
    Point(){}
    Point(double x,double y):x(x),y(y){}
    bool operator==(const Point& rhs)const
    {
        return dcmp(x-rhs.x)==0 && dcmp(y-rhs.y)==0;
    }
    bool operator<(const Point& rhs)const
    {
        return dcmp(x-rhs.x)<0 || (dcmp(x-rhs.x)==0 && dcmp(y-rhs.y)<0);
    }
};
typedef Point Vector;
Vector operator-(Point A,Point B)
{
    return Vector(A.x-B.x,A.y-B.y);
}
double Cross(Vector A,Vector B)
{
    return A.x*B.y-A.y*B.x;
}
double PolygonArea(Point *p,int n)
{
    double area=0;
    for(int i=1;i<n-1;i++)
        area += Cross(p[i]-p[0],p[i+1]-p[0]);
    return fabs(area)/2;
}
int ConvexHull(Point *p,int n,Point *ch)
{
    sort(p,p+n);
    n=unique(p,p+n)-p;
    int m=0;
    for(int i=0;i<n;i++)
    {
        while(m>1 && Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2])<=0) m--;
        ch[m++]=p[i];
    }
    int k=m;
    for(int i=n-2;i>=0;i--)
    {
        while(m>k && Cross(ch[m-1]-ch[m-2], p[i]-ch[m-2])<=0) m--;
        ch[m++]=p[i];
    }
    if(n>1) m--;
    return m;
}

const int maxn=100+5;
Point p[maxn],ch[maxn];
int main()
{
    int n,kase=0;
    while(scanf("%d",&n)==1 && n)
    {
        for(int i=0;i<n;i++)
            scanf("%lf%lf",&p[i].x,&p[i].y);

        double area1=PolygonArea(p,n);
        int m=ConvexHull(p,n,ch);
        double area2=PolygonArea(ch,m);
        printf("Tile #%d\n",++kase);
        printf("Wasted Space = %.2lf %%\n\n",(area2-area1)*100.0/area2);
    }
    return 0;
}