LightOJ 1331-Agent J【计算几何】

Love The Way You Lie 2022-08-21 12:51 107阅读 0赞

1331 - Agent J

<table> 
 <tbody> 
  <tr> 
   <td title="special judge" style="color:rgb(79,107,114)"><a href="http://lightoj.com/volume_submit.php?problem=1331" style="color:rgb(79,107,114)" rel="nofollow"><img src="http://lightoj.com/images/submit3.png" alt="">&nbsp;</a>&nbsp;&nbsp;<a href="http://udebug.com/LOJ/1331" style="color:rgb(79,107,114)" rel="nofollow"><img src="http://lightoj.com/images/udebug.png" alt=""></a></td> 
   <td style="color:rgb(79,107,114)"><a href="http://lightoj.com/volume_showproblem.php?problem=1331&amp;language=english&amp;type=pdf" style="color:rgb(79,107,114)" rel="nofollow">PDF (English)</a></td> 
   <td style="color:rgb(79,107,114)"><a href="http://lightoj.com/volume_problemstat.php?problem=1331" style="color:rgb(79,107,114)" rel="nofollow">Statistics</a></td> 
   <td style="color:rgb(79,107,114)"><a href="http://lightoj.com/forum_showproblem.php?problem=1331" style="color:rgb(79,107,114)" rel="nofollow">Forum</a></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td style="color:rgb(121,114,104); background:rgb(245,250,250)">Time Limit:&nbsp;<span style="color:rgb(180,95,4)">1 second(s)</span></td> 
   <td style="color:rgb(121,114,104); background:rgb(245,250,250)">Memory Limit:&nbsp;<span style="color:rgb(180,95,4)">32 MB</span></td> 
  </tr> 
 </tbody> 
</table>

Agent **J** is preparing to steal an antique diamond piece from a museum. As it is fully guarded and they are guarding it using high technologies, it's not easy to steal the piece. There are three circular laser scanners in the museum which are the main headache for Agent **J**. The scanners are centered in a certain position, and they keep rotating maintaining a certain radius. And they are placed such that their coverage areas **touch** each other as shown in the picture below:

![a.png][]

Here **R1**, **R2** and **R3** are the radii of the coverage areas of the three laser scanners. The diamond is placed in the place blue shaded region as in the picture. Now your task is to find the area of this region for Agent **J**, as he needs to know where he should land to steal the diamond.

# Input #

Input starts with an integer **T (≤ 1000)**, denoting the number of test cases.

Each case starts with a line containing three real numbers denoting **R1, R2** and **R3 (0 < R1, R2, R3 ≤ 100)**. And no number contains more than two digits after the decimal point.

# Output #

For each case, print the case number and the area of the place where the diamond piece is located. Error less than **10\-6** will be ignored.

<table> 
 <tbody> 
  <tr> 
   <td> <h1 style="color:green">Sample Input</h1> </td> 
   <td> <h1 style="color:green">Output for Sample Input</h1> </td> 
  </tr> 
  <tr> 
   <td> <p>3</p> <p>1.0 1.0 1.0</p> <p>2 2 2</p> <p>3 3 3</p> </td> 
   <td> <p>Case 1: 0.16125448</p> <p>Case 2: 0.645017923</p> <p>Case 3: 1.4512903270</p> </td> 
  </tr> 
 </tbody> 
</table>

--------------------

解题思路：

海伦公式计算三角形面积，计算三个扇形面积。

#include<stdio.h>
    #include<string.h>
    #include<algorithm>
    #include<cmath>
    const double pi=acos(-1.0);  
    using namespace std;
    int main()
    {
    	int t;
    	scanf("%d",&t);
    	int cnm=0;
    	while(t--)
    	{
    		double a,b,c;
    		scanf("%lf%lf%lf",&a,&b,&c);
    		printf("Case %d: ",++cnm);
    		double S,s1,s2,s3;
    		double p=(a+b+c); 
    		S=sqrt(p*(p-(a+b))*(p-(a+c))*(p-(b+c)));
    		double a1,b1,c1;
    		double r1=c+b,r2=a+c,r3=a+b;
    		c1=acos((r1*r1+r2*r2-r3*r3)/(2*r1*r2));  
            b1=acos((r1*r1+r3*r3-r2*r2)/(2*r3*r1));
    		a1=acos((r2*r2+r3*r3-r1*r1)/(2*r2*r3)) ; 
            s1=a1*a*a/2;  
            s2=b1*b*b/2;  
            s3=c1*c*c/2;
            double ans=S-s1-s2-s3;
            printf("%.8lf\n",ans);
    	}
    	return 0;
    }

[a.png]: /images/20220724/d94cb7b25ac442629eadff97ec87f5c5.png