zoukankan      html  css  js  c++  java
  • hdu 1115 Lifting the Stone (数学几何)

    Lifting the Stone

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 5203    Accepted Submission(s): 2155


    Problem Description
    There are many secret openings in the floor which are covered by a big heavy stone. When the stone is lifted up, a special mechanism detects this and activates poisoned arrows that are shot near the opening. The only possibility is to lift the stone very slowly and carefully. The ACM team must connect a rope to the stone and then lift it using a pulley. Moreover, the stone must be lifted all at once; no side can rise before another. So it is very important to find the centre of gravity and connect the rope exactly to that point. The stone has a polygonal shape and its height is the same throughout the whole polygonal area. Your task is to find the centre of gravity for the given polygon. 
     
    Input
    The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing a single integer N (3 <= N <= 1000000) indicating the number of points that form the polygon. This is followed by N lines, each containing two integers Xi and Yi (|Xi|, |Yi| <= 20000). These numbers are the coordinates of the i-th point. When we connect the points in the given order, we get a polygon. You may assume that the edges never touch each other (except the neighboring ones) and that they never cross. The area of the polygon is never zero, i.e. it cannot collapse into a single line. 
     
    Output
    Print exactly one line for each test case. The line should contain exactly two numbers separated by one space. These numbers are the coordinates of the centre of gravity. Round the coordinates to the nearest number with exactly two digits after the decimal point (0.005 rounds up to 0.01). Note that the centre of gravity may be outside the polygon, if its shape is not convex. If there is such a case in the input data, print the centre anyway. 
     
    Sample Input
    2
    4
    5 0
    0 5
    -5 0
    0 -5
    4
    1 1
    11 1
    11 11
    1 11
     
    Sample Output
    0.00 0.00
    6.00 6.00
     
    Source
     
    数学几何,求多边形重心,乘上面积增加精度。
     
     1 //15MS    376K    695 B    C++    
     2 #include<stdio.h>
     3 #include<math.h>
     4 #define N 1000005
     5 struct node{
     6     double x,y; 
     7 }p[N];
     8 double getsum(node a,node b,node c)
     9 {
    10     return ((b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y))/2.0;
    11 }
    12 int main(void)
    13 {
    14     int t,n;
    15     scanf("%d",&t);
    16     while(t--)
    17     {
    18         scanf("%d",&n);
    19         for(int i=0;i<n;i++)
    20             scanf("%lf%lf",&p[i].x,&p[i].y);
    21         double ss=0,sx=0,sy=0;
    22         for(int i=0;i<n-2;i++){
    23             double ts=getsum(p[0],p[i+1],p[i+2]);
    24             ss+=ts;
    25             sx+=ts*(p[0].x+p[i+1].x+p[i+2].x);
    26             sy+=ts*(p[0].y+p[i+1].y+p[i+2].y);
    27         }
    28         printf("%.2lf %.2lf
    ",sx/ss/3,sy/ss/3);
    29     }
    30     return 0;
    31 }
  • 相关阅读:
    js Array的方法及属性总结
    js 继承
    js 判断数据类型
    序列化和反序列化
    express 常用方法和插件
    node 常用的对象
    node.js 守护进程
    CentOS7安装Python3.8.1和ansible
    MAC终端终极美化方案
    Linux之top命令详解
  • 原文地址:https://www.cnblogs.com/GO-NO-1/p/3764152.html
Copyright © 2011-2022 走看看