Submission #1131296
Source Code Expand
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string& s, char c) { vector<string> v; stringstream ss(s); string x; while(getline(ss,x,c)) v.emplace_back(x); return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
const ll MOD=1e9+7;
typedef array<array<int,3>,3> AR;
int main(){
ios_base::sync_with_stdio(false);
cout<<fixed<<setprecision(0);
int n;
cin>>n;
if(n>3) return 0;
AR orig;
rep(i,n){
string s;
cin>>s;
rep(j,n) orig[i][j]=(s[j]=='#');
}
queue<AR> que; que.push(orig);
map<AR,int> dst; dst[orig]=0;
while(que.size()){
AR t=que.front(); que.pop();
int f=1;
rep(i,n)rep(j,n)if(t[i][j]==0) f=0;
if(f){
cout<<dst[t]<<endl;
return 0;
}
rep(i,n)rep(j,n){
AR nxt=t;
rep(k,n) nxt[k][j]=t[i][k];
if(dst.count(nxt)) continue;
dst[nxt]=dst[t]+1;
que.push(nxt);
}
}
cout<<-1<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Row to Column |
User |
nuip |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
2756 Byte |
Status |
WA |
Exec Time |
3 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
Subtask |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
0 / 1000 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
Subtask |
0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt |
All |
0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt |
Case Name |
Status |
Exec Time |
Memory |
0_00.txt |
AC |
1 ms |
256 KB |
0_01.txt |
AC |
1 ms |
256 KB |
0_02.txt |
AC |
1 ms |
256 KB |
0_03.txt |
AC |
1 ms |
256 KB |
0_04.txt |
AC |
2 ms |
256 KB |
1_00.txt |
AC |
1 ms |
256 KB |
1_01.txt |
AC |
1 ms |
256 KB |
1_02.txt |
AC |
2 ms |
256 KB |
1_03.txt |
AC |
2 ms |
256 KB |
1_04.txt |
AC |
2 ms |
256 KB |
1_05.txt |
AC |
2 ms |
256 KB |
1_06.txt |
AC |
2 ms |
256 KB |
1_07.txt |
AC |
2 ms |
256 KB |
1_08.txt |
AC |
1 ms |
256 KB |
1_09.txt |
AC |
2 ms |
256 KB |
1_10.txt |
AC |
3 ms |
256 KB |
1_11.txt |
AC |
1 ms |
256 KB |
1_12.txt |
AC |
1 ms |
256 KB |
1_13.txt |
AC |
1 ms |
256 KB |
1_14.txt |
AC |
3 ms |
256 KB |
2_00.txt |
WA |
1 ms |
256 KB |
2_01.txt |
WA |
1 ms |
256 KB |
2_02.txt |
WA |
1 ms |
256 KB |
2_03.txt |
WA |
1 ms |
256 KB |
2_04.txt |
WA |
1 ms |
256 KB |
2_05.txt |
WA |
1 ms |
256 KB |
2_06.txt |
WA |
1 ms |
256 KB |
2_07.txt |
WA |
1 ms |
256 KB |
2_08.txt |
WA |
1 ms |
256 KB |
2_09.txt |
WA |
1 ms |
256 KB |
2_10.txt |
WA |
1 ms |
256 KB |
2_11.txt |
WA |
1 ms |
256 KB |
2_12.txt |
WA |
1 ms |
256 KB |
2_13.txt |
WA |
1 ms |
256 KB |
2_14.txt |
WA |
1 ms |
256 KB |
2_15.txt |
WA |
1 ms |
256 KB |
2_16.txt |
WA |
1 ms |
256 KB |
2_17.txt |
WA |
1 ms |
256 KB |
2_18.txt |
WA |
1 ms |
256 KB |
2_19.txt |
WA |
1 ms |
256 KB |
2_20.txt |
WA |
1 ms |
256 KB |
2_21.txt |
WA |
1 ms |
256 KB |
2_22.txt |
WA |
1 ms |
256 KB |