专题:计算几何学 (多边形的中心) hdu1115Lifting the Stone

题目链接附上:
http://acm.hdu.edu.cn/showproblem.php?pid=1115
代码链接:
https://github.com/fangtanchen/Learning/tree/master/1_Algorithm/hdu/ACM_STEP/ch7/s1/3

题目
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

解法思想

  • 简单题目,割成多个三角形,计算相应三角形的重心,再算出加权中心
  • 顺时针和逆时针有区别, 0.00和-0.00是不同的
  • printf(“%.2lf\n”,…)会自动四舍五入

两种代码如下




#include<iostream>
#include<cstdio>
#include<cstring>
//#include<vector>
#include<algorithm>


#ifdef L_JUDGE
#pragma warning(disable:4996)
#endif

using namespace std;
const int MAXN=1e6+10;


double totalarea;
double ansx,ansy;

int main(){
    #ifdef L_JUDGE
        freopen("in.txt","r",stdin);
        //freopen("out.txt","w",stdout);
    #endif
    int T,N;
    scanf("%d",&T);
    while(T--){
        totalarea=0;
        double sigmax=0,sigmay=0;
         scanf("%d",&N);
         double ox,oy,ax,ay,bx,by;
         scanf("%lf%lf",&ox,&oy);
         ax=ox;ay=oy;
         for(int i=2;i<=N;i++){
             scanf("%lf%lf",&bx,&by);
             double area=-(bx)*ay+by*ax;
             totalarea+=area;
             double tx=(ax+bx);
             double ty=(ay+by);
             sigmax+=(tx)*area;
             sigmay+=(ty)*area;
             ax=bx;ay=by;
         }
         double area=-ox*ay+oy*ax;
         totalarea+=area;
         sigmax+=(ox+ax)*area;
         sigmay+=(oy+ay)*area;
         sigmax=sigmax/3/totalarea;
         sigmay=sigmay/3/totalarea;

         //sigmax=int((sigmax+0.005)*100)/100.0;
         //sigmay=int((sigmay+0.005)*100)/100.0;
         printf("%.2lf %.2lf\n",sigmax,sigmay);
    }

    #ifdef L_JUDGE
        fclose(stdin);
        fclose(stdout);
        system("out.txt");
    #endif

    return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
//#include<vector>
#include<algorithm>

#define U_DEBUG
#define L_JUDGE

#ifdef L_JUDGE
#pragma warning(disable:4996)
#endif

using namespace std;
const int MAXN=1e6+10;

struct Node {
    double x;
    double y;
    Node(const Node &p){
        x=p.x;
        y=p.y;
    }
    Node(int a=0,int b=0){
        x=a;y=b;
    }
};

double Direction(const Node &p1,const Node &p2,const Node &p3){
    double ret=(p3.x-p1.x)*(p2.y-p1.y)-(p2.x-p1.x)*(p3.y-p1.y);
    return ret/2.0;
}


int main(){
    #ifdef L_JUDGE
        freopen("in.txt","r",stdin);
        //freopen("out.txt","w",stdout);
    #endif
    int T,N;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&N);
        double sigmax,sigmay,totalarea;
        sigmax=sigmay=totalarea=0;
        Node p1,p2,p3;
        scanf("%lf%lf%lf%lf",&p1.x,&p1.y,&p2.x,&p2.y);
        for(int i=2;i<N;i++){
            scanf("%lf%lf",&p3.x,&p3.y);
            double  area=Direction(p1,p3,p2);
            totalarea+=area;
            sigmax+=(p1.x+p2.x+p3.x)*area/3;
            sigmay+=(p1.y+p2.y+p3.y)*area/3;
            p2=p3;
        }



         //sigmax=int((sigmax+0.005)*100)/100.0;
         //sigmay=int((sigmay+0.005)*100)/100.0;
         printf("%.2lf %.2lf\n",sigmax/totalarea,sigmay/totalarea);
    }

    #ifdef L_JUDGE
        fclose(stdin);
        fclose(stdout);
        system("out.txt");
    #endif

    return 0;
}

“`

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值