提出 #36050187

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using ld = long double;
using pll = pair<ll, ll>;
// and so on
string arr[10];
vector<pii> pos;
bool issquare(int a, int b, int c, int d) {
    pii p[4] = {pos[a], pos[b], pos[c], pos[d]};
    int dist[4][4];
    for (int i = 0; i < 4; i++) {
        for (int j = 0; j < 4; j++) {
            auto [ax, ay] = p[i];
            auto [bx, by] = p[j];
            dist[i][j] = (ax - bx) * (ax - bx) + (ay - by) * (ay - by);
        }
        sort(dist[i], dist[i] + 4);
    }
    int r = dist[0][1];
    for (int i = 0; i < 4; i++) {
        for (int j = 1; j < 3; j++)
            if (dist[i][j] != r) return false;
    }
    r = dist[0][3];
    for (int i = 1; i < 4; i++)
        if (r != dist[i][3]) return false;
    return true;
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    for (int i = 0; i < 10; i++) cin >> arr[i];
    for (int i = 0; i < 10; i++) {
        for (int j = 0; j < 10; j++) {
            if (arr[i][j] == '#') pos.push_back({i, j});
        }
    }
    int ans = 0;
    int N = pos.size();
    for (int i = 0; i < N; i++) {
        for (int j = i + 1; j < N; j++) {
            for (int k = j + 1; k < N; k++) {
                for (int l = k + 1; l < N; l++) {
                    ans += issquare(i, j, k, l);
                }
            }
        }
    }
    cout << ans;
}

提出情報

ジャッジ結果