Codeforces Round #618 (Div. 2)（D Aerodynamic）（计算几何）

Codeforces Round #618 (Div. 2)（D Aerodynamic）（计算几何）

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
judge: 点我跳转

Description

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 $P$ which is defined by coordinates of its vertices. Define $P(x,y)$ as a polygon obtained by translating $P$ by vector $\overrightarrow{(x,y)}$. The picture below depicts an example of the translation:

Define $T$ as a set of points which is the union of all $P(x,y)$ such that the origin $(0,0)$ lies in $P(x,y)$ (both strictly inside and on the boundary). There is also an equivalent definition: a point $(x,y)$ lies in $T$ only if there are two points $A,B$ in $P$ such that $\overrightarrow{AB}=\overrightarrow{(x,y)}$. One can prove $T$ is a polygon too. For example, if $P$ is a regular triangle then $T$ is a regular hexagon. At the picture below $P$ is drawn in black and some $P(x,y)$ which contain the origin are drawn in colored:

The spaceship has the best aerodynamic performance if $P$ and $T$ are similar. Your task is to check whether the polygons $P$ and $T$ are similar.

Input

The first line of input will contain a single integer $n$ ($3\le n\le 10^5$) — the number of points.

The $i$-th of the next $n$ lines contains two integers $x_i,y_i$ ($|x_i|,|y_i|\le 10^9$), denoting the coordinates of the $i$-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 $P$ and $T$ are similar. Otherwise, output “NO” in a separate line. You can print each letter in any case (upper or lower).

Examples

input

4
1 0
4 1
3 4
0 3

output

YES

input

3
100 86
50 0
150 0

output

NO

input

8
0 0
1 0
2 1
3 3
4 6
3 6
2 5
1 3

output

YES

Note

The following image shows the first sample: both $P$ and $T$ are squares. The second sample was shown in the statements.

题解

一个图形在包含原点的前提下不断平移，其覆盖的部分形成了一个新的图形，判断这个新图形是否和原来的图形相似。

新图形就相当于把原点贴着图形的边移动图形拼接成的新的图形。

找规律会发现只要原图形是中心对称图形，那么新图形就和原图形相似。

放几个样例：

而题目已经保证点的顺序是顺时针（其实逆时针也可），我们只需要判断所有的对边是否平行即可。

代码

#include <bits/stdc++.h>
#define maxn 300005
#define _for(i, a) for(int i = 0; i < (a); ++i)
using namespace std;

struct poi {
	int x, y;
	poi() {}
	poi(int x, int y) :x(x), y(y) {}
	bool operator * (const poi &b) {
		if (y == b.y && x == b.x || y == -b.y && x == -b.x) return 1;
		else return 0;
	}
};

int n;
poi a[maxn];

bool sol() {
	if (n & 1) return 0;
	_for(i, n / 2) {
		if (!(poi(a[i + 1].x - a[i].x, a[i + 1].y - a[i].y) * poi(a[(i + 1 + n / 2) % n].x - a[i + n / 2].x, a[(i + 1 + n / 2) % n].y - a[i + n / 2].y))) return 0;
	}
	return 1;
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	//freopen("in.txt", "r", stdin);

	while (cin >> n) {
		_for(i, n) cin >> a[i].x >> a[i].y;
		cout << (sol() ? "YES\n" : "NO\n");
	}
	return 0;
}