Submission #1131463


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int INF = 1e9;

int n;
map<vector<string>, int> memo;

bool judge(vector<string>& a) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (a[i][j] != '#') return false;
		}
	}
	return true;
}

int solve(vector<string>& a) {
	if (memo.find(a) != memo.end()) return memo[a];
	if (judge(a)) return 0;
	memo[a] = INF;
	int res = INF;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			vector<string> b(a);
			for (int k = 0; k < n; k++) {
				b[k][j] = a[i][k];
			}
			if (memo.find(b) != memo.end() && memo[b] == INF) continue; 
			res = min(res, solve(b) + 1);
		}
	}
	memo[a] = res;
	return res;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cin >> n;
	vector<string> a(n);
	for (int i = 0; i < n; i++) cin >> a[i];
	int ans = solve(a);
	cout << (ans == INF ? -1 : ans) << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Row to Column
User fine
Language C++14 (GCC 5.4.1)
Score 0
Code Size 938 Byte
Status WA
Exec Time 2120 ms
Memory 390256 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 300 0 / 1000
Status
AC × 5
AC × 17
WA × 3
AC × 18
WA × 3
TLE × 22
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 6 ms 512 KB
0_04.txt AC 5 ms 512 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt WA 5 ms 512 KB
1_03.txt AC 5 ms 512 KB
1_04.txt WA 5 ms 512 KB
1_05.txt AC 5 ms 512 KB
1_06.txt WA 5 ms 512 KB
1_07.txt AC 5 ms 512 KB
1_08.txt AC 5 ms 512 KB
1_09.txt AC 5 ms 512 KB
1_10.txt AC 5 ms 512 KB
1_11.txt AC 5 ms 512 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 6 ms 512 KB
1_14.txt AC 5 ms 512 KB
2_00.txt TLE 2103 ms 884 KB
2_01.txt AC 2 ms 512 KB
2_02.txt TLE 2120 ms 390256 KB
2_03.txt TLE 2105 ms 42940 KB
2_04.txt TLE 2103 ms 1408 KB
2_05.txt TLE 2103 ms 1408 KB
2_06.txt TLE 2105 ms 42940 KB
2_07.txt TLE 2113 ms 233620 KB
2_08.txt TLE 2117 ms 320352 KB
2_09.txt TLE 2115 ms 284628 KB
2_10.txt TLE 2115 ms 282112 KB
2_11.txt TLE 2114 ms 254804 KB
2_12.txt TLE 2118 ms 339464 KB
2_13.txt TLE 2115 ms 278452 KB
2_14.txt TLE 2117 ms 320992 KB
2_15.txt TLE 2105 ms 52300 KB
2_16.txt TLE 2106 ms 62712 KB
2_17.txt TLE 2106 ms 58244 KB
2_18.txt TLE 2106 ms 57512 KB
2_19.txt TLE 2106 ms 66232 KB
2_20.txt TLE 2106 ms 69460 KB
2_21.txt TLE 2105 ms 44372 KB
2_22.txt TLE 2105 ms 50100 KB