HDU1115--Lifting the Stone（求凸多边形的重心）-白红宇

HDU1115--Lifting the Stone（求凸多边形的重心）

阅读量：5292 次

发布时间：2019-06-14

本文共 2984 字，大约阅读时间需要 9 分钟。

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

245 00 5-5 00 -541 111 111 111 11

Sample Output

0.00 0.006.00 6.00

Source

Central Europe 1999

Recommend

Eddy

求多边形重心的模版题，

将多边形分为多个三角形，如下图：

而多变形的重心根据下式推导出来：

其中，（Xgi，Ygi）为第i个三角形的重心，Si 为第i个三角形的面积，Sall 为凸多边形的总面积，而（Xg，Yg）为多边形的重心

代码如下：

/*题目输出要求有一句exactly two digits after the decimal point (0.005 rounds up to 0.01)。而直接使用%.2f是会有带来误差的，因为其自带的是“伪四舍五入”，也就是说：2.54 -> 2.52.55 -> 2.52.56 -> 2.6即当题目要求保留2位小数且四舍五入时，应将自己的结果加上0.001，保证当结果为2.555时能进位。*/#include
     
      #include
      
       #include
       using namespace std;const int MAXN=1000100;struct node{    int x,y;}a[MAXN];double _X(node &p1,node &p2,node &p3){    return (p2.x-p1.x)*(p3.y-p1.y)-(p3.x-p1.x)*(p2.y-p1.y);}pair
        
          zhongxin(node &p1,node &p2,node &p3){    pair
         
           tmp;    tmp.first=(p1.x+p2.x+p3.x)/3.0;    tmp.second=(p1.y+p2.y+p3.y)/3.0;    return tmp;}int main(){    //freopen("data.in","r",stdin);    int t;    cin>>t;    while(t--){        int n;        cin>>n;        for(int i=0;i
          
           >a[i].x>>a[i].y; } double Sall=0,xg=0,yg=0; pair
           
             tmp; double m=0; for(int i=1;i

转载于:https://www.cnblogs.com/liuzhanshan/p/6237632.html

你可能感兴趣的文章