HDU 6354 Everything Has Changed (余弦定理)

最新推荐文章于 2019-07-25 20:18:00 发布

等我学会后缀自动机

最新推荐文章于 2019-07-25 20:18:00 发布

阅读量288

点赞数

CC 4.0 BY-SA版权

分类专栏： HDU习题集计算几何暴力与模拟

本文链接：https://blog.youkuaiyun.com/qq_37451344/article/details/81474304

HDU习题集同时被 3 个专栏收录

259 篇文章

订阅专栏

暴力与模拟

27 篇文章

订阅专栏

计算几何

2 篇文章

订阅专栏

本文介绍了如何运用余弦定理解决HDU 6354编程题目，通过数学原理解析和代码实现，详细阐述了解题思路与步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Everything Has Changed

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 461 Accepted Submission(s): 261
Special Judge

Problem Description

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) and radius R . Then, m mechanical arms will cut and erase everything within its area of influence simultaneously, the i -th area of which is a circle with center coordinates (xi,yi) and radius ri (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 T , indicating the number of test cases.
The following lines describe all the test cases. For each test case:
The first line contains two integers m and R .
The i -th line of the following m lines contains three integers xi,yi and ri , indicating a cutting area.
1≤T≤1000 , 1≤m≤100 , −1000≤xi,yi≤1000 , 1≤R,ri≤1000 (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−6 .
Formally, let your answer be a and the jury's answer be b . Your answer is considered correct if |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

Source

2018 Multi-University Training Contest 5

Recommend

chendu | We have carefully selected several similar problems for you: 6361 6360 6359 6358 6357

#include<iostream>
#include<algorithm>
#include<string>
#include<map>//int dx[4]={0,0,-1,1};int dy[4]={-1,1,0,0};
#include<queue>//int gcd(int a,int b){return b?gcd(b,a%b):a;}
#include<vector>
#include<cmath>
#include<stack>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
#define mod 1e9+7
#define ll unsigned long long
#define MAX 1000000000
#define ms memset
#define maxn 20
using namespace std;
const double pi=acos(-1.0);
/*
题目大意：给定一个大圆，和m个小圆，
按图求周长。

掌握了余弦定理就简单了，
先判断其是否和圆有交点，
外切不计算，内切计算。
统计一下，注意精度

*/
int m;
double x,y,d,r;

double dist(double x,double y)
{
    return sqrt(x*x+y*y);
}

double yuxian(double r1,double r2,double r3)
{
    ///cout<<r1<<" "<<r2<<endl;
    double ans= (r1*r1+r2*r2-r3*r3)/(2.0*r1*r2);
    return ans;
}

int main()
{
    int t;scanf("%d",&t);
    while(t--)
    {
        scanf("%d%lf",&m,&r);
        double len=2.0*pi*r;
        for(int i=0;i<m;i++)
        {
            scanf("%lf%lf%lf",&x,&y,&d);
            double dis=dist(x,y);
            if(dis>=d+r) continue;
            if(dis+d<r) continue;

            len=len-2.0*r*acos(yuxian(r,dis,d));
            len=len+2.0*d*acos(yuxian(d,dis,r));
        }
        ///cout<<len<<endl;
        printf("%.10f\n",len);
    }
    return 0;
}