Submission #1131285

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back

#define INF 1000000007
#define N 510
int n;
string a[N];

int main() {
	cin >> n;
	for (int i = 0; i < n; i ++) cin >> a[i];
	int U = 0;
	for (int j = 0; j < n; j ++) {
		bool F = false;
		for (int i = 0; i < N; i ++)
			if (a[i][j] == '.') F = true;
		if (F) U++;
	}
	
	int S = INF;
	
	for (int i = 0; i < n; i ++) {
		int T = U;
		bool F = false;
		for (int k = 0; k < n; k ++)
			if (a[k][i] == '#') {
				F = true;
				break;
			}
		for (int j = 0; j < n; j ++) 
			if (a[i][j] == '.') T++;
		if (!F && T > U) continue;
		S = min(S, T);
	}
	if (S == INF) puts ("-1");
	else printf ("%d\n", S);
	return 0;
}

Submission Info

Judge Result