凸包学会之后,本题应该并不困难。适合练手
#include<bits/stdc++.h>
using namespace std;
struct Point
{
double x,y;
Point(double x=0,double y=0):x(x),y(y) { }
};
typedef Point Vector;
double torad(double deg)//角度转化为弧度
{
return deg/180*acos(-1);
}
int cmp(Point a,Point b)
{
if(a.x!=b.x)
return a.x<b.x;
if(a.x==b.x)
return a.y<b.y;
}
Vector operator - (Point A,Point B)
{
return Vector(A.x-B.x,A.y-B.y);
}
double Cross(Point a,Point B)
{
return a.x*B.y-a.y*B.x;
}
int ConvexHull(Point *p,int n,Point *ch)//Andrew算法
{
sort(p,p+n,cmp);
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;
}
double sum(Point *ch,int x)//求多边形面积
{
double m=0;
for(int i=1;i<=x-1;i++)
m+=Cross(ch[i]-ch[0],ch[i+1]-ch[0]);
return m/2;
}
Vector Rotate(Vector A,double rad)
{
return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));
}
Vector operator + (Vector A,Vector B)
{
return Vector(A.x+B.x,A.y+B.y);
}
int main()
{
int t;
Point P[2500],ch[2500];
scanf("%d",&t);
for(int i=1;i<=t;i++)
{
int n,pc=0;
double area1=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
double x,y,w,h,j,ang;
scanf("%lf%lf%lf%lf%lf",&x,&y,&w,&h,&j);
Point o(x,y);
ang=-torad(j);
P[pc++]= o+Rotate(Vector(-w/2,-h/2),ang);//矩形的四个顶点
P[pc++]= o+Rotate(Vector(w/2,-h/2),ang);
P[pc++]= o+Rotate(Vector(-w/2,h/2),ang);
P[pc++]= o+Rotate(Vector(w/2,h/2),ang);
area1+=w*h;
}
int m=ConvexHull(P,pc,ch);
double area2=sum(ch,m);
printf("%.1lf %%\n",area1*100/area2);
}
return 0;
}