【bzoj 1043】下落的圆盘（计算几何）

传送门biu~
n2计算两圆间是否覆盖，将被覆盖的弧存到被覆盖的圆中，最后再枚举每个圆，删掉被覆盖的弧长计算周长。

#include<bits/stdc++.h>
#define N 1005
using namespace std;
const double eps=1e-9,pi=acos(-1);
int n;double ans;bool b[N];
struct arc{double fr,to;arc(double _=0,double __=0){fr=_;to=__;}};vector<arc>a[N];
inline bool cmp(arc a,arc b){return a.fr<b.fr;}
struct point{double x,y;};
double dis(point a,point b){return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}
struct circle{point o;double r;}c[N];
inline bool in(circle a,circle b){return a.r+dis(a.o,b.o)<b.r+eps;}
inline bool out(circle a,circle b){return in(b,a) || a.r+b.r<dis(a.o,b.o)+eps;}
inline void Cut(int x,int y){
    double d=dis(c[x].o,c[y].o);        
    double theta=acos((c[x].r*c[x].r+d*d-c[y].r*c[y].r)/(2*d*c[x].r));
    double alpha=atan2(c[y].o.y-c[x].o.y,c[y].o.x-c[x].o.x);
    if(alpha<0)     alpha+=2*pi;
    alpha-=theta;           
    theta=alpha+theta*2;
    if(alpha<0) alpha+=2*pi;
    if(theta>2*pi)  theta-=2*pi;
    if(theta<alpha){
        a[x].push_back(arc(alpha,2*pi));
        a[x].push_back(arc(0,theta));
    }
    else    a[x].push_back(arc(alpha,theta));
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;++i){
        scanf("%lf%lf%lf",&c[i].r,&c[i].o.x,&c[i].o.y);
        for(int j=1;j<i;++j){
            if(!b[j]){
                if(in(c[j],c[i])){
                    b[j]=true;
                    continue;
                }
                if(out(c[j],c[i]))  continue;
                Cut(j,i);
            }
        }
    }
    for(int i=1;i<=n;++i){
        if(!b[i]){
            if(!a[i].size()){
                ans+=2*pi*c[i].r;
                continue;
            }   
            sort(a[i].begin(),a[i].end(),cmp);
            double rest=2*pi-a[i][0].to+a[i][0].fr,now=a[i][0].to;
            for(int j=1;j<a[i].size();++j){
                rest-=max(0.0,a[i][j].to-max(a[i][j].fr,now));
                now=max(now,a[i][j].to);
            }
            ans+=rest*c[i].r;
        }
    }
    printf("%.3lf\n",ans);
    return 0;
}