题面:
有n个圆盘从天而降,后面落下的可以盖住前面的。求最后形成的封闭区域的周长。看下面这副图,
所有的红色线条的总长度即为所求. N<=1000
题目分析:
思路很简短的一道圆题。。求相交弧度取个并集。
然而。。做圆相交牢记一点: 判断两个圆是否是包含或者相离!!(没判的我WA到自闭。。)
取并集的细节看一看代码,当前圆被覆盖的时候直接break。
Code:
#include<cstdio>
#include<cmath>
#include<algorithm>
#define maxn 1005
using namespace std;
struct Point{
double x,y; Point(){}
Point(double x,double y):x(x),y(y){}
bool operator < (const Point &p)const{return x<p.x;}
}a[maxn],q[maxn<<1];
const double eps = 1e-8, inf = 1e20, Pi = acos(-1);
int n;
double ans,sum,D,R[maxn];
#define sqr(x) (x)*(x)
inline double dist(Point &a,Point &b){return sqrt(sqr(a.x-b.x)+sqr(a.y-b.y));}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lf%lf%lf",&R[i],&a[i].x,&a[i].y);
for(int i=1;i<=n;i++){
double l,r,alpha,theta;
int top=0;
for(int j=i+1;j<=n;j++){
D=dist(a[i],a[j]);
if(R[i]+D<=R[j]) goto he;
else if(R[i]+R[j]>D&&R[j]+D>R[i]){
alpha=atan2(a[j].y-a[i].y,a[j].x-a[i].x),theta=acos((sqr(R[i])+sqr(D)-sqr(R[j]))/(2*R[i]*D));
l=alpha-theta, r=alpha+theta;
if(l<-Pi) l+=2*Pi,r+=2*Pi;
if(r>Pi) q[++top]=Point(l,Pi),q[++top]=Point(-Pi,r-2*Pi);
else q[++top]=Point(l,r);
}
}
sum=2*Pi, r=-inf;
sort(q+1,q+1+top);
for(int j=1;j<=top;j++)
if(q[j].x>r) sum-=q[j].y-q[j].x,r=q[j].y;
else if(q[j].y>r) sum-=q[j].y-r,r=q[j].y;
ans+=R[i]*sum; he:;
}
printf("%.3f",ans);
}