hdoj-1115-Lifting the Stone 求多边形重心问题
来源:互联网 发布:淘宝网店品牌授权书 编辑:程序博客网 时间:2024/06/15 04:17
Lifting the Stone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6329 Accepted Submission(s): 2624
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 | We have carefully selected several similar problems for you: 1392 1086 2108 2150 1348
#include<stdio.h>#include<math.h>struct p{double x,y;};double cross(p a,p b,p c){return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);}int main(){int t;scanf("%d",&t);while(t--){int n;p p1,p2,tp;double res=0,s,tx=0,ty=0;scanf("%d",&n);scanf("%lf%lf%lf%lf",&p1.x,&p1.y,&p2.x,&p2.y);for(int i=3;i<=n;++i){scanf("%lf%lf",&tp.x,&tp.y); s=cross(p1,p2,tp);res+=s;tx+=(p1.x+p2.x+tp.x)*s;ty+=(p1.y+p2.y+tp.y)*s;p2.x=tp.x;p2.y=tp.y;}printf("%.2lf %.2lf\n",tx/(3*res),ty/(3*res));}return 0;}
0 0
- hdoj-1115-Lifting the Stone 求多边形重心问题
- HDOJ 1115 Lifting the Stone (求多边形重心坐标)
- HDOJ 1115 Lifting the Stone 多边形重心
- ACM--多边形重心–-HDOJ 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(求多边形的重心)
- 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-1115-Lifting the Stone
- Magento Block的缓存机制
- MyEclipse使用总结——MyEclipse10安装SVN插件
- OC_NSString 字符串的方法
- J2SE核心开发实战(一)——认识J2SE
- android Scroller浅析
- hdoj-1115-Lifting the Stone 求多边形重心问题
- 红黑树的插入过程
- LINUx 信号摘要
- 状态模式
- <转>Openstack Ceilometer监控项扩展
- Strust MVC 和Spring MVC框架的区别?
- php数组排序(可升降序)
- Android sqlite数据库操作卡顿解决办法
- eclipse快捷键及各种设置