hdoj 5533 Dancing Stars on Me

题目链接：Dancing Stars on Me

题目大意：给你n个整数点，问这些点能不能构成一个正n边形

题目思路：我们可以知道的是整点里面只能构成正方形，然后我们知道这样一个东西：
正方形已知两个点，算另外两个点的公式：
已知： (x1,y1) (x2,y2)
则： x3=x1+(y1-y2) y3= y1-(x1-x2)
x4=x2+(y1-y2) y4= y2-(x1-x2)
或
x3=x1-(y1-y2) y3= y1+(x1-x2)
x4=x2-(y1-y2) y4= y2+(x1-x2)
然后套一下公式用$map<pair<>,bool>$做就好了

#include <map>
#include <set>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define ll long long
#define mk make_pair
#define y1 yyy
using namespace std;

const int N = 1e3 + 5;

map< pair<int, int>, bool> M;
int x[N], y[N], n, ans;

int main() {
    int T;
    scanf("%d",&T);
    while (T--) {
        scanf("%d", &n);
        ans = 0;
        M.clear();
        for (int i = 1; i <= n; i++) {
            scanf("%d %d", x + i, y + i);
            M[mk(x[i], y[i])] = 1;

        }
        if(n != 4) {puts("NO");continue;}
        for (int i = 1; i <= n; i++) {
            for (int j = i + 1; j <= n; j++) {
                int dx = y[j] - y[i];
                int dy = x[i] - x[j];
                int ok = 0;
                if (M.count(mk(x[i] + dx, y[i] + dy))) ok++;
                if (M.count(mk(x[j] + dx, y[j] + dy))) ok++;
                if (ok == 2) ans++;
                ok = 0;
                if (M.count(mk(x[i] - dx, y[i] - dy))) ok++;
                if (M.count(mk(x[j] - dx, y[j] - dy))) ok++;
                if (ok == 2) ans++;
            }
        }
        printf("%s\n", ans / 4 == 0?"NO":"YES");
    }
    return 0;
}