Submission #1365428

---

Source Code Expand

#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define fill(x, y) memset(x, y, sizeof x)
#define copy(x, y) memcpy(x, y, sizeof x)
using namespace std;

typedef long long LL;
typedef pair < int, int > pa;

inline int read()
{
	int sc = 0, f = 1; char ch = getchar();
	while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') sc = sc * 10 + ch - '0', ch = getchar();
	return sc * f;
}

const int MAXN = 505;
const int INF = INT_MAX;

int n, a[MAXN][MAXN], ans = INF, c, cnt;

int main()
{
#ifdef wxh010910
	freopen("data.in", "r", stdin);
#endif
	n = read();
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= n; a[i][j ++] = c == '#')
			for (c = getchar(); c != '#' && c != '.'; c = getchar());
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= n; j ++)
			if (!a[j][i])
			{
				cnt ++;
				break;
			}
	for (int i = 1; i <= n; i ++)
	{
		int ret = 0, f = 0;
		for (int j = 1; j <= n; j ++)
			if (a[i][j])
			{
				f = 1;
				break;
			}
		if (!f) continue;
		for (int j = 1; j <= n; j ++)
			if (a[j][i])
			{
				f = 0;
				break;
			}
		if (f) ret ++;
		for (int j = 1; j <= n; j ++) ret += !a[i][j];
		ans = min(ans, ret + cnt);
	}
	if (ans == INF) ans = -1;
	return printf("%d\n", ans), 0;
}

Submission Info

Judge Result