链接 D. Aerodynamic
题意
给一个严格的凸包,然后让它的边始终在原点上,运动产生一个轮廓,问这个轮廓是否和原来的凸包相似。
思路
手画一下样例,自己再画几个图形,会发现只有中心对称图形是符合题意的;
然后求出中心点,对于凸包的每一个顶点,去求对称的点是否存在即可;
AC代码
#include <bits/stdc++.h>
#define mes memset
#define mec memcpy
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define be(x) (x).begin(), (x).end()
#define cl(x) memset((x), 0, sizeof (x))
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll,ll> PLL;
const double pi = acos(-1);
const double eps = 1e-8;
const int N = 100010;
const int null = 0x3f3f3f3f,INF = 1e9;
const ll mod = 998244353;
ll x[N];
ll y[N];
int main()
{
int n;
cin >> n;
map<PLL, int> mp;
ll xx = 0, yy = 0;
for (int i = 1; i <= n; i ++)
{
cin >> x[i] >> y[i];
x[i] *= n;
y[i] *= n;
xx += x[i];
yy += y[i];
mp[{x[i], y[i]}] = 1;
}
xx /= n, yy /= n;
for (int i = 1; i <= n; i ++)
{
if (!mp[{2 * xx - x[i], 2 * yy - y[i]}])
{
puts("NO");
return 0;
}
}
puts("YES");
}