Submission #1131201
Source Code Expand
#include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <vector> #include <cstring> #include <string> #include <set> #include <map> #include <stack> #include <queue> #include <algorithm> using namespace std; #define REP(i,n) for(int i=0; i<n; ++i) #define FOR(i,a,b) for(int i=a; i<=b; ++i) #define FORR(i,a,b) for (int i=a; i>=b; --i) #define ALL(c) (c).begin(), (c).end() typedef long long ll; typedef vector<int> VI; typedef vector<ll> VL; typedef vector<VI> VVI; typedef pair<int,int> P; typedef pair<ll,ll> PL; typedef vector<string> VS; int main() { int n; cin >> n; if (n > 3) return 0; VS s(n); REP(i,n) cin >> s[i]; queue<VS> que; que.push(s); map<VS, int> mp; mp[s] = 1; while (!que.empty()){ VS a = que.front(); int d = mp[a]; que.pop(); REP(i,n) REP(j,n){ VS b(a); string x; REP(k,n) x += a[i][k]; REP(k,n) b[k][j] = x[k]; if (mp[b] > 0) continue; mp[b] = d + 1; que.push(b); } } VS goal(n); REP(i,n) REP(j,n) goal[i] += '#'; int ans = mp[goal]; cout << (ans == 0 ? -1 : ans - 1) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Row to Column |
User | TangentDay |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1296 Byte |
Status | WA |
Exec Time | 5 ms |
Memory | 768 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 | 5 ms | 768 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 5 ms | 384 KB |
0_04.txt | AC | 5 ms | 384 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 5 ms | 384 KB |
1_03.txt | AC | 5 ms | 384 KB |
1_04.txt | AC | 5 ms | 384 KB |
1_05.txt | AC | 5 ms | 384 KB |
1_06.txt | AC | 5 ms | 384 KB |
1_07.txt | AC | 5 ms | 384 KB |
1_08.txt | AC | 5 ms | 384 KB |
1_09.txt | AC | 5 ms | 384 KB |
1_10.txt | AC | 5 ms | 384 KB |
1_11.txt | AC | 5 ms | 384 KB |
1_12.txt | AC | 1 ms | 256 KB |
1_13.txt | AC | 5 ms | 384 KB |
1_14.txt | AC | 5 ms | 384 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 |