Submission #1131219
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using P = pair<int, int>; const ll MOD = 1000000007; int main(){ int N; cin >> N; vector<char> a(N*N); for(int i=0;i<N*N;i++){ cin >> a[i]; } queue<pair<int, vector<char>>> que; que.emplace(0, a); set<vector<char>> visited; visited.insert(a); while(que.size()){ auto p = que.front(); que.pop(); bool ok = true; for(int i=0;i<N*N;i++){ if(p.second[i] == '.'){ ok = false; break; } } if(ok){ cout << p.first << endl; return 0; } for(int i=0;i<N;i++){ for(int j=0;j<N;j++){ vector<char> na = p.second; for(int k=0;k<N;k++){ na[k*N + j] = p.second[i*N + k]; } if(visited.count(na) == 0){ visited.insert(na); que.emplace(p.first + 1, na); } } } } cout << -1 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Row to Column |
User | zaburo |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1169 Byte |
Status | TLE |
Exec Time | 2260 ms |
Memory | 1826588 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 | 2 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 | 2 ms | 256 KB |
2_00.txt | TLE | 2103 ms | 1280 KB |
2_01.txt | AC | 15 ms | 1280 KB |
2_02.txt | TLE | 2114 ms | 245384 KB |
2_03.txt | TLE | 2110 ms | 157576 KB |
2_04.txt | TLE | 2103 ms | 1672 KB |
2_05.txt | TLE | 2103 ms | 1672 KB |
2_06.txt | TLE | 2110 ms | 157576 KB |
2_07.txt | TLE | 2239 ms | -1092396 KB |
2_08.txt | TLE | 2260 ms | -689136 KB |
2_09.txt | TLE | 2217 ms | -1643236 KB |
2_10.txt | TLE | 2184 ms | 1826588 KB |
2_11.txt | TLE | 2260 ms | -719088 KB |
2_12.txt | TLE | 2256 ms | -791272 KB |
2_13.txt | TLE | 2255 ms | -793292 KB |
2_14.txt | TLE | 2241 ms | -1093852 KB |
2_15.txt | TLE | 2115 ms | 251832 KB |
2_16.txt | TLE | 2123 ms | 444848 KB |
2_17.txt | TLE | 2123 ms | 430788 KB |
2_18.txt | TLE | 2120 ms | 372832 KB |
2_19.txt | TLE | 2118 ms | 330648 KB |
2_20.txt | TLE | 2120 ms | 368608 KB |
2_21.txt | TLE | 2117 ms | 300268 KB |
2_22.txt | TLE | 2111 ms | 149136 KB |