E - Everything Has Changed HDU - 6354

https://vjudge.net/contest/314399#problem/E

 

Edward is a worker for Aluminum Cyclic Machinery. His work is operating mechanical arms to cut out designed models. Here is a brief introduction of his work. 
Assume the operating plane as a two-dimensional coordinate system. At first, there is a disc with center coordinates (0,0)(0,0) and radius RR. Then, mm mechanical arms will cut and erase everything within its area of influence simultaneously, the ii-th area of which is a circle with center coordinates (xi,yi)(xi,yi) and radius riri (i=1,2,⋯,m)(i=1,2,⋯,m). In order to obtain considerable models, it is guaranteed that every two cutting areas have no intersection and no cutting area contains the whole disc. 
Your task is to determine the perimeter of the remaining area of the disc excluding internal perimeter. 
Here is an illustration of the sample, in which the red curve is counted but the green curve is not. 

Input

The first line contains one integer TT, indicating the number of test cases. 
The following lines describe all the test cases. For each test case: 
The first line contains two integers mm and RR. 
The ii-th line of the following mm lines contains three integers xi,yixi,yi and riri, indicating a cutting area. 
1≤T≤10001≤T≤1000, 1≤m≤1001≤m≤100, −1000≤xi,yi≤1000−1000≤xi,yi≤1000, 1≤R,ri≤10001≤R,ri≤1000 (i=1,2,⋯,m)(i=1,2,⋯,m).

Output

For each test case, print the perimeter of the remaining area in one line. Your answer is considered correct if its absolute or relative error does not exceed 10−610−6.
Formally, let your answer be aa and the jury's answer be bb. Your answer is considered correct if |a−b|max(1,|b|)≤10−6|a−b|max(1,|b|)≤10−6. 
Sample Input

1
4 10
6 3 5
10 -4 3
-2 -4 4
0 9 1

Sample Output

81.62198908430238475376

 1 #include <iostream>
 2 #include <stdio.h>
 3 #include <algorithm>
 4 #include <cmath>
 5 #include <math.h>
 6 #include <cstring>
 7 #include <string>
 8 #include <queue>
 9 #include <deque>
10 #include <stack>
11 #include <stdlib.h>
12 #include <list>
13 #include <map>
14 #include <utility>
15 #include <time.h>
16 #include <set>
17 #include <bitset>
18 #include <vector>
19 #define ms(a,b) memset(a,b,sizeof(a))
20 #define ll long long
21 
22 using namespace std;
23 
24 const int maxn = 100+10;
25 const int INF = 0x3f3f3f3f;
26 
27 double dis(double x1,double y1){
28     return sqrt(x1 * x1 + y1 * y1);
29 }
30 int main(){
31     int t;
32     double pi = acos(-1.0);
33     char n[12];
34     cin >> t;
35     while(t--){
36        double ans;
37        double R;
38        int m;
39        cin >> m;
40        scanf ("%lf",&R);
41        ans = 2 * R * pi;
42        while(m--)
43        {
44            double x,y,r;
45            scanf("%lf%lf%lf",&x,&y,&r);
46            double dist = dis(x,y);
47            if(dist + r == R)
48            {
49                 ans += 2 * r * pi;
50            }
51            else if(dist >= r + R || dist + r < R)
52            {
53                 continue;
54            }
55            else
56            {
57                 double del = acos((R * R + dist * dist - r * r) / (2 * dist * R));
58                 double si = acos((r * r + dist * dist - R * R) / (2 * dist * r));
59                 ans = ans - del * R * 2 + si * r * 2;
60             }
61        }
62        printf("%lf\n",ans);
63     }
64     return 0;
65 }        

View Code

 

转载于:https://www.cnblogs.com/SutsuharaYuki/p/11301498.html