Submission #1131292

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,vector<string> >P;
int n;

vector<string>& check(vector<string> &v,int x,int y){
  vector<string> &t=v;
  for(int i=0;i<n;i++)
    t[y][i]=v[i][x];
    return t;
}

int main(){
  vector<string> v;
  string s;
  cin>>n;
  for(int i=0;i<n;i++){
    cin>>s;
    v.push_back(s);
  }
  queue<P> q;
  q.push(P(0,v));
  while(!q.empty()){
    P p=q.front();
    q.pop();
    if(p.first==8){cout<<-1<<endl;break;}
    bool f=1;
    for(int i=0;i<n;i++)
      for(int j=0;j<n;j++)
	if(p.second[i][j]=='.')f=0;
    if(f){cout<<p.first<<endl;break;}
    for(int i=0;i<n;i++)
      for(int j=0;j<n;j++)
	q.push(P(p.first+1,check(p.second,j,i)));
  }
  return 0;
}

Submission Info

Judge Result