zoukankan      html  css  js  c++  java
  • Peter and Snow Blower

     Peter and Snow Blower
     

    Peter got a new snow blower as a New Year present. Of course, Peter decided to try it immediately. After reading the instructions he realized that it does not work like regular snow blowing machines. In order to make it work, you need to tie it to some point that it does not cover, and then switch it on. As a result it will go along a circle around this point and will remove all the snow from its path.

    Formally, we assume that Peter's machine is a polygon on a plane. Then, after the machine is switched on, it will make a circle around the point to which Peter tied it (this point lies strictly outside the polygon). That is, each of the points lying within or on the border of the polygon will move along the circular trajectory, with the center of the circle at the point to which Peter tied his machine.

    Peter decided to tie his car to point P and now he is wondering what is the area of ​​the region that will be cleared from snow. Help him.

    Input

    The first line of the input contains three integers — the number of vertices of the polygon n (), and coordinates of point P.

    Each of the next n lines contains two integers — coordinates of the vertices of the polygon in the clockwise or counterclockwise order. It is guaranteed that no three consecutive vertices lie on a common straight line.

    All the numbers in the input are integers that do not exceed 1 000 000 in their absolute value.

    Output

    Print a single real value number — the area of the region that will be cleared. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.

    Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if .

    Examples
    Input
    3 0 0
    0 1
    -1 2
    1 2
    Output
    12.566370614359172464
    Input
    4 1 -1
    0 0
    1 2
    2 0
    1 1
    Output
    21.991148575128551812
    Note

    In the first sample snow will be removed from that area: 

    大圆 - 小圆 ; 大圆半径为最远点, 小圆半径分情况, 有可能相邻两点与旋转点距离相等,  利用三角形边角关系来找最短边 ;

    #include <cmath>
    #include <cstdio>
    #include <iostream>
    #define N 100005
    #define PI acos(-1.0)
    using namespace std; 
    struct point
    {
        double x, y;
    } rec[N];
    double cross(point p, point p1)
    {
        return sqrt((p1.x-p.x)*(p1.x-p.x)+(p1.y-p.y)*(p1.y-p.y));
    }
    int main()
    {
        point firP; int t;
        while(scanf("%d%lf%lf", &t, &firP.x, &firP.y) != EOF)
        {
            for(int i=0; i<t; i++)
                scanf("%lf%lf", &rec[i].x, &rec[i].y);
            rec[t]=rec[0];    //顺、 逆时针; 
            double maxL=-1, minL=99999999;
            for(int i=0; i<t; i++)
            {
                double a=cross(firP, rec[i]);
                double b=cross(firP, rec[i+1]);
                double c=cross(rec[i], rec[i+1]);
                maxL=max(maxL, max(a, b));
                if((c*c+b*b)<=a*a) minL=min(minL, b);    //利用钝角来找短边; 
                else if((a*a+c*c)<=b*b) minL=min(minL, a);
                else
                {
                    double p=(a+b+c)/2.0;                //海伦公式求高 ; 
                    double s=sqrt(p*(p-a)*(p-b)*(p-c));
                    minL=min(minL, s*2.0/c);
                }
            }
            printf("%.7lf
    ", PI*(maxL*maxL-minL*minL));
            
        }
        return 0;
    }
  • 相关阅读:
    iOS开发之巧用Block和代理方法结合来传值
    iOS开发之Bug--UITextField使用时文字向下偏移问题
    iOS开发之开源项目链接
    IOS开发之Bug--iOS7View被导航栏遮挡问题的解决
    Android开发--异步加载
    添加 All Exceptions 断点后, 每次运行都会在 main.m 中断的一种解决方法
    IOS开发之Bug--遇到一个类型不确定的bug
    iOS开发之功能模块--计算高度Demo探究手稿
    IOS开发之Bug--View是懒加载导致出误以为是UI加载的bug
    iOS中的round/ceil/floorf函数略解
  • 原文地址:https://www.cnblogs.com/soTired/p/5355493.html
Copyright © 2011-2022 走看看