Submission #1131199

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#define INF_LL 1e18
#define INF 1e9

#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()

using namespace std;

using ll = long long;
using PII = pair<int, int>;

template<typename T>
void chmax(T &a, T &b){
	a = max(a, b);
}

template<typename T>
void chmin(T &a, T &b){
	a = min(a, b);
}

class Union_find{
private:
	vector<int> par;
	vector<int> rank;
	int n;

public:
	Union_find(int a){
		n = a;
		for(int i = 0;i < n;i++){
			par.push_back(i);
			rank.push_back(0);
		}
	}

	int find(int x){
		if(par[x] == x){
			return x;
		}else{
			return par[x] = find(par[x]);
		}
	}

	void unite(int x, int y){
		x = find(x);
		y = find(y);
		if(x == y) return;

		if(rank[x] < rank[y]){
			par[x] = y;
		}else{
			par[y] = x;
			if(rank[x] == rank[y]) rank[x]++;
		}
	}

	bool same(int x, int y){
		return find(x) == find(y);
	}
};

int main(void){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	vector<string> f;
	cin >> N;
	REP(i, N){
		string s;
		cin >> s;
		f.push_back(s);
	}
	queue<pair<int, vector<string> > > q;
	q.push({0, f});
	map<vector<string>, bool> used;
	while(q.size()){
		int cnt = q.front().first;
		f = q.front().second; q.pop();
		bool ok = false, end = true;
		REP(i, f.size()){
			REP(j, f[i].size()){
				if(f[i][j] == '.')
					end = false;
				else
					ok = true;
			}
		}
		if(end){
			cout << cnt << endl;
			return 0;
		}
		if(!ok || used[f]){
			continue;
		}
		used[f] = true;
		REP(i, f.size()){
			REP(j, f[i].size()){
				vector<string> tmp = f;
				REP(k, f.size()) tmp[k][j] = f[i][k];
				q.push({cnt+1, tmp});
			}
		}
	}
	cout << -1 << endl;
}

Submission Info

Judge Result