HDU 4667

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <assert.h>

const int MAXN = 300;
const double PI2 = acos(-1.0) * 2.0;
const double EPS = 1e-5;
const double pi  = acos(-1.0);

struct REC{
    double x,y,r;
}list[MAXN],in[MAXN];
int ptr[2*MAXN];
char flag[MAXN][MAXN];

inline double arctan(const double& dy,const double& dx){
    double t = atan2(dy,dx);
    if(t < 0) t += PI2;
    return t;
}

void normalize(double &ang){
    if(ang<0) ang+=PI2;
    else if(ang>PI2) ang-=PI2;
}

double distance(REC& a,REC& b){
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

double calc(REC& a,REC& b,REC& c){
    double ret=0;
    double ang_in,ang_out;
    double d,ang,deltaR,l,theta;
    ang = arctan(a.y-b.y,a.x-b.x);
    d = distance(a,b);
    deltaR = a.r- b.r;
    theta = asin(deltaR/d);
    ang_in = ang + theta + PI2/4.0;
    ang = arctan(c.y - b.y,c.x - b.x);
    d= distance (b,c);
    deltaR = c.r - b.r;
    theta = asin(deltaR/d);
    ang_out = ang - theta - PI2/4.0;
    if(ang_out < ang_in) ang_out+=PI2;
    ret = b.r *(ang_out-ang_in);
    l = sqrt(d*d - deltaR *deltaR);
    return l+ret;
}
int main()
{
    int N,M,i;
    while(~scanf("%d%d",&N,&M)){
        if(N==1 && M==0){
            double s,d,g;
            scanf("%lf %lf %lf",&s,&d,&g);
            double xx = 2 * pi * g;
            printf("%.5lf\n",xx);
            continue;
        }

        int t=0; double x,y;
        for(int i=0;i<N;i++){
            scanf("%lf %lf %lf",&in[t].x,&in[t].y,&in[t].r);
            t++;
        }
        for(int i=0;i<M;i++){
            for(int j=0;j<3;j++){
                scanf("%lf %lf",&x,&y);
                in[t].x=x;
                in[t].y=y;
                in[t].r=0;
                t++;
            }
        }

        double ymin=1e50,xmin=1e50;
        int ori=-1;
        N = t;
        for(i=0;i<N;i++){
            list[i] = in[i];
            if(list[i].y-list[i].r<ymin){
                ymin=list[i].y-list[i].r;
                xmin=list[i].x;
                ori=i;
            }
        }
        int p;
        double last = -1.0;
        memset(flag,0,sizeof(flag));
        ptr[0] = ori;
        for(p=1;;p++){
            int sel= -1;
            double amin = 1.0e10,len=-1.0;
            double d,deltaR,ang,theta,l;
            for(int i=0;i<N;i++){
                if(ptr[p-1]==i) continue;
                ang = arctan(list[i].y-list[ptr[p-1]].y,list[i].x-list[ptr[p-1]].x);
                d=distance(list[i],list[ptr[p-1]]);
                deltaR = list[i].r-list[ptr[p-1]].r;
                theta = asin(deltaR/d);
                ang -= theta;
                normalize(ang);
                l=sqrt(d*d-deltaR*deltaR);
                if(ang<last) ang+=PI2;
                if(ang<amin-EPS){
                    amin=ang;
                    len=l;
                    sel=i;
                }
                else if(ang<amin+EPS){
                    if(l>len) {len=l;sel=i;}
                }
            }
            last = amin;
            ptr[p] = sel;
            if(flag[ptr[p-1]][ptr[p]]){
                break;
            }
            flag[ptr[p-1]][ptr[p]] = 1;
        }
        N = p-1;
        double acc;
        acc= calc(list[ptr[N-1]],list[ptr[0]],list[ptr[1]]);
        for(i=1;i<N;i++){
            acc+=calc(list[ptr[i-1]],list[ptr[i]],list[ptr[i+1]]);
        }
        printf("%.5lf\n",acc);
    }
    return 0;
}