D. Aerodynamic

向岸看

于 2020-02-18 22:47:24 发布

阅读量180

点赞数

本文链接：https://blog.csdn.net/qq_45981086/article/details/104282734

版权

Guy-Manuel and Thomas are going to build a polygon spaceship.

You’re given a strictly convex (i. e. no three points are collinear) polygon PP which is defined by coordinates of its vertices. Define P(x,y)P(x,y) as a polygon obtained by translating PP by vector (x,y)−→−−(x,y)→. The picture below depicts an example of the translation:
在这里插入图片描述

Define TT as a set of points which is the union of all P(x,y)P(x,y) such that the origin (0,0)(0,0) lies in P(x,y)P(x,y) (both strictly inside and on the boundary). There is also an equivalent definition: a point (x,y)(x,y) lies in TT only if there are two points A,BA,B in PP such that AB−→−=(x,y)−→−−AB→=(x,y)→. One can prove TT is a polygon too. For example, if PP is a regular triangle then TT is a regular hexagon. At the picture below PP is drawn in black and some P(x,y)P(x,y) which contain the origin are drawn in colored:
在这里插入图片描述

The spaceship has the best aerodynamic performance if PP and TT are similar. Your task is to check whether the polygons PP and TT are similar.

Input
The first line of input will contain a single integer nn (3≤n≤1053≤n≤105) — the number of points.

The ii-th of the next nn lines contains two integers xi,yixi,yi (|xi|,|yi|≤109|xi|,|yi|≤109), denoting the coordinates of the ii-th vertex.

It is guaranteed that these points are listed in counterclockwise order and these points form a strictly convex polygon.

Output
Output “YES” in a separate line, if PP and TT are similar. Otherwise, output “NO” in a separate line. You can print each letter in any case (upper or lower).

Examples
inputCopy
4
1 0
4 1
3 4
0 3
outputCopy
YES
inputCopy
3
100 86
50 0
150 0
outputCopy
nO
inputCopy
8
0 0
1 0
2 1
3 3
4 6
3 6
2 5
1 3
outputCopy
YES
Note
The following image shows the first sample: both PP and TT are squares. The second sample was shown in the statements.

在这里插入图片描述
题目大意：平移n边形（1<=n<=1e5）某顶点到达原点，所得到的多边形，是否与原图形相似
解题思路：不难看出平移得到的图形都是中心对称图形，只要确定原图形是否为中心对称图形即可。
求中心对称图形方法：
1.n为偶数
2.对角线中心重合

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    int n;
    cin>>n;
    long long int x[10001],y[10001];
    int t=0;
    for(int i=1;i<=n;i++){
        cin>>x[i]>>y[i];
    }
    if(n%2!=0){
        printf("nO\n");
    }
    else{
        for(int i=1;i<=n/2;i++){
            if((x[i]+x[n/2+i]!=x[1]+x[1+n/2])||(y[i]+y[n/2+i]!=y[1]+y[n/2+1])){
                printf("nO\n");
                t++;
                break;
            }
        }
        if(t==0){
        printf("YES\n");
        }
    }
    return 0;
}