Submission #1132593

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<map>
#include<set>
#include<functional>
#include<queue>
using namespace std;

string OK = "##################";
int main() {
	int k; cin >> k;
	string a;
	for (int l = 0; l < k; l++) {
		string r; cin >> r;
		a += r;
	}
	queue<string>Q;
	Q.push(a);
	int sum = 0;
	while (sum<8) {
		queue<string>copy;
		while (Q.size()) {
			string c = Q.front(); Q.pop();
			if (c == OK.substr(0, k*k)) {
				cout << sum << endl; return 0;
			}
			for (int i = 0; i < k; i++) {
				for (int j = 0; j < k; j++) {
					string d = c;
					string e;
					for (int f = 0; f < k; f++) {
						e += c[i * k + f];
					}
					for (int f = 0; f < k; f++) {
						d[f * k + j] = e[f];
					}
					copy.push(d);
				}
			}
		}
		Q = copy;
		sum++;
	}
	puts("-1");
}

Submission Info

Judge Result