hdu 1115 Lifting the Stone 计算几何
来源:互联网 发布:淘宝联盟如何推广 编辑:程序博客网 时间:2024/06/04 08:25
Lifting the Stone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5818 Accepted Submission(s): 2438
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
老规矩,上博客:
http://www.cnblogs.com/jbelial/archive/2011/08/08/2131165.html
http://blog.csdn.net/cs_zlg/article/details/7870799
代码:
#include <stdio.h>#define MAX 1000010struct Point{double x, y ;}p[3];int main(){int t ;scanf("%d",&t) ;while(t--){double sumArea = 0.0 , sumX = 0.0 , sumY = 0.0 ;int n ;scanf("%d",&n);scanf("%lf%lf%lf%lf",&p[0].x,&p[0].y,&p[1].x,&p[1].y) ;for(int i = 0 ; i < n-2 ; ++i){scanf("%lf%lf",&p[2].x,&p[2].y) ;double s = ((p[1].x-p[0].x)*(p[2].y-p[0].y)-(p[2].x-p[0].x)*(p[1].y-p[0].y))/2 ;sumX += (p[0].x+p[1].x+p[2].x)*s ;sumY += (p[0].y+p[1].y+p[2].y)*s ;sumArea += s ;p[1] = p[2] ; }printf("%.2lf %.2lf\n",sumX/3/sumArea,sumY/3/sumArea) ;}return 0 ;}
1 0
- HDU 1115 Lifting the Stone 计算几何
- hdu 1115 Lifting the Stone 计算几何
- hdu 1115 Lifting the Stone(计算几何(重心))
- HDU 1115 Lifting the Stone(计算几何)
- HDOJ 1115 Lifting the Stone 【计算几何】
- HDU 1115 Lifting the Stone 计算几何(多边形找重心)
- HDOJ 1115 Lifting the Stone (计算几何+多边形重心)
- HDU 1115 Lifting the Stone
- HDU 1115 Lifting the Stone
- hdu-1115-Lifting the Stone
- hdu 1115 Lifting the Stone
- HDU 1115 Lifting the Stone
- HDU 1115 Lifting the Stone
- HDU-Lifting the Stone
- ACM-计算几何之Lifting the Stone——hdu1115
- 【计算几何初步:多边形中心】【HDU1115】Lifting the Stone
- HDU 1115 Lifting the Stone(多边形重心)
- hdu 1115 Lifting the Stone 多边形面积
- uva 11029 【快速幂】
- 自己写的Properties工具类
- POJ 1005: I Think I Need a Houseboat
- 安迪的第一个字典(set容器)
- ADO.NET 实体框架概述
- hdu 1115 Lifting the Stone 计算几何
- CoreData并发处理
- XHR的用法
- 深入了解android平台的jni---注册native函数
- jackson解决:null到"", 空值处理为空串
- ubuntu下安装solr
- 1070. Mooncake (25)
- OpenCV结构简介
- windows使用system身份执行cmd