技术笔记:UVALive4426BlasttheEnemy!计算几何求重心

简介: 技术笔记:UVALive4426BlasttheEnemy!计算几何求重心

D - Blast the Enemy!


Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu


Submit Status Practice UVALive 4426


Description


A new computer game has //代码效果参考:http://www.lyjsj.net.cn/wz/art_23104.html

just arrived and as an active and always-in-the-scene player, you should finish it before the next university term starts. At each stage of this game, you have to shoot an enemy robot on its weakness point. The weakness point of a robot is always the center of mass" of its 2D shape in the screen. Fortunately, all robot shapes are simple polygons with uniform density and you can write programs to calculate exactly the center of mass for each polygon.</p> <p>Let's have a more formal definition for center of mass (COM). The center of mass for a square, (also circle, and other symmetric shapes) is its center point. And, if a simple shape C is partitioned into two simple shapes A and B with areas SA and SB , then COM(C) (as a vector) can be calculated by </p> <p>COM( C) = .</p> <p>As a more formal definition, for a simple shape A with area SA : </p> <p>COM( A) = </p> <p>Input</p> <p>The input contains a number of robot definitions. Each robot definition starts with a line containing n , the number of vertices in robot's polygon (n100) . The polygon vertices are //代码效果参考:http://www.lyjsj.net.cn/wz/art_23094.html<p></p> specified in the next n lines (in either clockwise or counter-clock-wise order). Each of these lines contains two space-separated integers showing the coordinates of the corresponding vertex. The absolute value of the coordinates does not exceed 100. The case of n = 0 shows the end of input and should not be processed. </p> <p>Output</p> <p>The i -th line of the output should be of the form Stage #i:x y " (omit the quotes), where ( x, y ) is the center of mass for the i -th robot in the input. The coordinates must be rounded to exactly 6 digits after the decimal point.

Sample Input


4


0 0


0 1


1 1


1 0


3


0 1


1 0


2 2


8


1 1


2 1


2 7


3 7


3 0


0 0


0 7


1 7


0


Sample Output


Stage #1: 0.500000 0.500000


Stage #2: 1.000000 1.000000


Stage #3: 1.500000 3.300000


#include


#include


#include


#include


#include


#include


#include [span style="color: rgba(0, 0, 255, 1)">set

#include


#include


#include


#include


#include


typedef long long ll;


using namespace std;


//freopen("D.in","r",stdin);


//freopen("D.out","w",stdout);


#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)


#define maxn 1001


const int inf=0x7fffffff; //无限大


int main()


{


int N;


double x【maxn】,y【maxn】,a【maxn】,ax【maxn】,ay【maxn】,xg=0,yg=0,a1=0,b1=0,c=0;


int t=0;


while(cin]N){


xg=0,yg=0,a1=0,b1=0,c=0;


t++;


int i,n;


if(N==0)


break;


for(i=0;i

{


scanf("%lf %lf",&x【i】,&y【i】);


}


for(i=0;i

{


a【i】=(y【i+1】+y【i】)(x【i】-x【i+1】)/2.0;


ax【i】=(x【i+1】x【i+1】+x【i+1】x【i】+x【i】x【i】)(y【i+1】-y【i】)/6.0;


ay【i】=(y【i+1】y【i+1】+y【i+1】y【i】+y【i】y【i】)(x【i】-x【i+1】)/6.0;


}


a【N-1】=(y【0】+y【N-1】)(x【N-1】-//代码效果参考:http://www.lyjsj.net.cn/wx/art_23102.html

x【0】)/2.0;

ax【N-1】=(x【0】x【0】+x【0】x【N-1】+x【N-1】x【N-1】)(y【0】-y【N-1】)/6.0;


ay【N-1】=(y【0】y【0】+y【0】y【N-1】+y【N-1】y【N-1】)(x【N-1】-x【0】)/6.0;


for(i=0;i

{


a1=a1+ax【i】;


b1=b1+a【i】;


c=c+ay【i】;


}


xg=a1/b1;


yg=c/b1;


printf("Stage #%d: %.6lf %.6lf\n",t,xg,yg);


}


return 0;


}

相关文章
|
9月前
|
数据库
新瓶装旧酒,纯生信三表一图孟德尔随机化8分Nature子刊
**摘要** 一项发表在《英国癌症杂志》(IF 8.8)上的研究利用孟德尔随机化方法分析了吸烟与结直肠癌(CRC)风险的关联。研究发现,吸烟开始会增加CRC风险,而戒烟则有保护效果,这些关联独立于其他吸烟特征和饮酒。通过基因预测的DNA甲基化,识别出CpG位点cg17823346 [ZMIZ1] 低甲基化降低CRC风险,而cg02149899高甲基化增加风险。共定位和基因-环境交互分析支持了这些表观遗传变化与CRC关联的生物学意义。研究强调了吸烟、DNA甲基化与CRC风险的显著联系,并为理解吸烟的致病机制提供了新见解。
118 2
|
8月前
|
算法 计算机视觉 Python
心得经验总结:数字图像处理
心得经验总结:数字图像处理
98 2
|
9月前
|
存储 C++
【C++练级之路】【Lv.15】AVL树(双子旋转,领略绝对平衡之美)
【C++练级之路】【Lv.15】AVL树(双子旋转,领略绝对平衡之美)
【C++练级之路】【Lv.15】AVL树(双子旋转,领略绝对平衡之美)
|
算法 C++
走进“深度搜索基础训练“,踏入c++算法殿堂(二)
走进“深度搜索基础训练“,踏入c++算法殿堂(二)
91 0
|
机器学习/深度学习 算法 C++
走进“深度搜索基础训练“,踏入c++算法殿堂(五)
走进“深度搜索基础训练“,踏入c++算法殿堂(五)
102 0
|
算法 C++
走进“深度搜索基础训练“,踏入c++算法殿堂(一)
走进“深度搜索基础训练“,踏入c++算法殿堂(一)
83 0
|
9月前
|
算法 数据可视化 vr&ar
【图形学】探秘图形学奥秘:DDA与Bresenham算法的解密与实战
【图形学】探秘图形学奥秘:DDA与Bresenham算法的解密与实战
154 0
|
机器学习/深度学习 算法 C++
走进“深度搜索基础训练“,踏入c++算法殿堂(四)
走进“深度搜索基础训练“,踏入c++算法殿堂(四)
90 0
|
算法 C++
走进“深度搜索基础训练“,踏入c++算法殿堂(三)
走进“深度搜索基础训练“,踏入c++算法殿堂(三)
104 0
|
算法 定位技术
“ 探索迷局:解密广度寻路算法 “(二)
“ 探索迷局:解密广度寻路算法 “

热门文章

最新文章