# hdu 1115 Lifting the Stone （凸包求多边形重心）

http://acm.hdu.edu.cn/showproblem.php?pid=1115

# Lifting the Stone

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

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

1，质量集中在顶点上。n个顶点坐标为(xi,yi)，质量为mi，则重心
X = ∑( xi×mi ) / ∑mi
Y = ∑( yi×mi ) / ∑mi
特殊地，若每个点的质量相同，则
X = ∑xi / n
Y = ∑yi / n

2，质量分布均匀。这个题就是这一类型，算法和上面的不同。
特殊地，质量均匀的三角形重心：
X = ( x0 + x1 + x2 ) / 3
Y = ( y0 + y1 + y2 ) / 3

#include <iostream>
#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <limits>
#include <stack>
#include <vector>
#include <map>

using namespace std;

#define N 200
#define INF 0xfffffff
#define PI acos (-1.0)
#define EPS 1e-8
#define met(a, b) memset (a, b, sizeof (a))

typedef long long LL;

double xmult (double x1, double y1, double x2, double y2, double x0, double y0)
{
return (x1-x0)*(y2-y0) - (x2-x0)*(y1-y0);
}

int main ()
{
int t, n;
scanf ("%d", &t);

while (t--)
{
scanf ("%d", &n);
double X = 0, Y = 0, sum = 0, x0, y0, x1, y1, x2, y2;
scanf ("%lf %lf %lf %lf", &x0, &y0, &x1, &y1);

for (int i=2; i<n; i++)
{
scanf ("%lf %lf", &x2, &y2);
double S = xmult (x1, y1, x2, y2, x0, y0)/2;
sum += S;
X += S * (x0+x1+x2);
Y += S * (y0+y1+y2);

x1 = x2, y1 = y2;
}

X /= (3*sum); Y /= (3*sum);
printf ("%.2f %.2f\n", X, Y);
}
return 0;
}


06-01 407

11-25 1062

07-24 252

03-09 612

11-04 1757

12-02 207

04-22 548

08-13 602

08-19 127

04-14 362