Submission #1131220

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long LL;
typedef pair<int, int> PII;

int n;
string s[3];
int dist[1234];

int toNum() {
    int num = 0;
    forn(i, n) forn(j, n) {
        num = 2 * num + (s[i][j] == '#');
    }
    return num;
}

void toTable(int num) {
    for (int i = n - 1; i >= 0; --i) {
        for (int j = n - 1; j >= 0; --j) {
            if (num & 1) {
                s[i][j] = '#';
            } else {
                s[i][j] = '.';
            }
            num >>= 1;
        }
    }
}

queue<int> q;

int main() {
    ios_base::sync_with_stdio(false);
    cin >> n;
    forn(i, n) {
        cin >> s[i];
    }
    memset(dist, -1, sizeof dist);
    int st = toNum();
    dist[st] = 0;
    q.push(st);
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        forn(i, n) forn(j, n) {
            toTable(v);
            string x;
            forn(k, n) {
                x += s[i][k];
            }
            forn(k, n) {
                s[k][j] = x[k];
            }
            int nv = toNum();
            if (dist[nv] == -1) {
                dist[nv] = dist[v] + 1;
                q.push(nv);
            }
        }
    }
    forn(i, n) forn(j, n) {
        s[i][j] = '#';
    }
    int need = toNum();
    cout << dist[need] << endl;
    return 0;
}

Submission Info

Judge Result