UVA 10652 Board Wrapping 简单凸包

UVA 10652 Board Wrapping 简单凸包

题目来源：http://vjudge.net/problem/UVA-10652

1，求出凸包，然后求面积。

2，套模板，稍微改动一些地方就可以了。

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2500 ;
const double PI = acos(-1) ;
struct Point{
    double x,y;
    Point(double x=0,double y=0):x(x),y(y){} ;
};
typedef Point Vector ;
const double eps = 1e-10 ;
int dcmp(double x){
    if(fabs(x)<eps)return 0;///精度范围内认为等于0
    else return x<0?-1:1 ;///小于0返回-1，大于0返回1
}
Vector operator + (Vector A,Vector B){return Vector(A.x+B.x,A.y+B.y);}
Vector operator - (Point A,Point B){return Vector(A.x-B.x,A.y-B.y);}
Vector operator * (Vector A,double p){return Vector(A.x*p,A.y*p);}
Vector operator / (Vector A,double p){return Vector(A.x/p,A.y/p);}
bool operator < (const Point& a,const Point& b){return a.x<b.x||(a.x==b.x&&a.y<b.y) ;}
bool operator == (const Point& a,const Point& b){
    return dcmp(a.x-b.x)==0&&dcmp(a.y-b.y)==0 ;
}
double Cross(Vector A,Vector B){return A.x*B.y - A.y*B.x ;}
Vector Rotate(Vector A,double rad){return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));}
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 area/2 ;
}

Point p[maxn] ;
Point ch[maxn] ;
int ConvexHull(Point* p, int n, Point* ch){
    sort(p, p+n);
    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;
}

int main(){
    int T;
    scanf("%d",&T) ;
    while(T--){
        int n;
        scanf("%d",&n);
        int c=0;
        double area1 = 0;
        for(int i=0;i<n;i++){
            double x,y,w,h,ang ;
            scanf("%lf%lf%lf%lf%lf",&x,&y,&w,&h,&ang);
            Point st = Point(x,y) ;
            ang = -(ang*2*PI/360) ;
            p[c++] = st+Rotate(Vector(-w/2,-h/2),ang);
            p[c++] = st+Rotate(Vector(w/2,-h/2),ang);
            p[c++] = st+Rotate(Vector(-w/2,h/2),ang);
            p[c++] = st+Rotate(Vector(w/2,h/2),ang);
            area1 += w*h ;
        }
        int m = ConvexHull(p,c,ch);
        //printf("m=%d\n",m);
        double area2 = PolygonArea(ch,m) ;
        //printf("area1 = %lf   area2 = %lf \n",area1,area2);
        printf("%.1lf %%\n",area1*100/area2);
    }
    return 0;
}