Submission #1131273


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

int nextInt() {int a; cin >> a; return a;}
char nextChar() {char a; cin >> a; return a;}
double nextDouble() {double a; cin >> a; return a;}
string nextString() {string a; cin >> a; return a;}

template<class T> void inputVector(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < v.size(); i++) cin >> v[i];
}

int n;
int ret = 10;

bool ok(const vector<string> &board) {
	int cnt = 0;
	rep(y, n) rep(x, n) cnt += board[y][x] == '#';
	return cnt == n * n;
}

void solve(vector<string> board, int dep) {
	if (dep == 6) return;
	dep++;
	rep(i, n) {
		rep(j, n) {
			vector<string> cboard = board;
			rep(k, n) cboard[k][j] = board[i][k];
			if (ok(cboard)) {
				ret = min(ret, dep);
				return;
			}
			solve(cboard, dep);
		}
	}
}

signed main() {
	cin >> n;

	if (n > 3) return 0;
	
	vector<string> board;
	inputVector(board, n);

	bool emp = true;
	rep(y, n) rep(x, n) if (board[y][x] == '#') emp = false;

	if (emp) {
		cout << -1 << endl;
		return 0;
	}

	if (ok(board)) {
		cout << 0 << endl;
		return 0;
	}

	solve(board, 0);

	cout << ret << endl;

    return 0;
}

Submission Info

Submission Time
Task B - Row to Column
User iwashi31
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1736 Byte
Status WA
Exec Time 230 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 0 / 1000
Status
AC × 5
AC × 20
AC × 20
WA × 23
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 2 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 136 ms 256 KB
0_04.txt AC 224 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 230 ms 256 KB
1_03.txt AC 225 ms 256 KB
1_04.txt AC 224 ms 256 KB
1_05.txt AC 222 ms 256 KB
1_06.txt AC 228 ms 256 KB
1_07.txt AC 229 ms 256 KB
1_08.txt AC 186 ms 256 KB
1_09.txt AC 212 ms 256 KB
1_10.txt AC 223 ms 256 KB
1_11.txt AC 190 ms 256 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 111 ms 256 KB
1_14.txt AC 221 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