Submission #46117850

---

Source Code Expand

#include <iostream>
#include <cstdlib>
#include <map>

using namespace std;

char a[5][5][5];
bool b[5][5][5];
int cnt, t[5][2][5], p[5][2], d[5];

bool check() {
    int s[15][15]{}, sum = 0, _s[2][15]{}, t0 = 0, t1 = 0;
    const int del = 3;

    auto add = [&](int i) {
        if (d[i] == 0) {
            for (int j = 1; j <= 4; j++)
                for (int k = 1; k <= 4; k++)
                    s[j + p[i][0] + del][k + p[i][1] + del] += b[i][j][k];
        } else if (d[i] == 1) {
            for (int j = 1; j <= 4; j++)
                for (int k = 1; k <= 4; k++)
                    s[j + p[i][0] + del][k + p[i][1] + del] += b[i][k][5 - j];
        } else if (d[i] == 2) {
            for (int j = 1; j <= 4; j++)
                for (int k = 1; k <= 4; k++)
                    s[j + p[i][0] + del][k + p[i][1] + del] += b[i][5 - j][5 - k];
        } else {
            for (int j = 1; j <= 4; j++)
                for (int k = 1; k <= 4; k++)
                    s[j + p[i][0] + del][k + p[i][1] + del] += b[i][5 - k][j];
        }
    };

    for (int i = 1; i <= 3; i++) add(i);
    for (int i = 0; i < 15; i++)
        for (int j = 0; j < 15; j++) {
            _s[0][i] += s[i][j] == 1;
            _s[1][j] += s[i][j] == 1;
            sum += s[i][j] == 1;
        }
    for (int i = 0 ; i< 15; i++) {
        t0 += _s[0][i] == 4;
        t1 += _s[1][i] == 4;
    }
    return t0 == 4 && t1 == 4;
}

void dfs(int i) {
    if (i == 4) {
        if (check()) {
            cout << "Yes" << endl;
            exit(0);
        }
        return;
    }
    for (p[i][0] = -3; p[i][0] <= 3; p[i][0]++)
        for (p[i][1] = -3; p[i][1] <= 3; p[i][1]++)
            for (d[i] = 0; d[i] < 4; d[i]++)
                dfs(i + 1);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    for (int i = 1; i <= 3; i++)
        for (int j = 1; j <= 4; j++)
            for (int k = 1; k <= 4; k++) {
                cin >> a[i][j][k];
                b[i][j][k] = (a[i][j][k] == '#');
                if (b[i][j][k]) {
                    cnt++;
                    t[i][0][j]++;
                    t[i][1][k]++;
                }
            }

    if (cnt == 16)
        dfs(2);

    cout << "No" << endl;
}

Submission Info

Judge Result