Submission #1519207

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
const int MAXN = 505;

int n;
char a[MAXN][MAXN];
int cnt1[MAXN], cnt2[MAXN];

int main(){
	cin >> n;
	for(int i=0; i<n; i++) cin >> a[i];
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			if(a[i][j] == '#'){
				cnt1[i]++;
				cnt2[j]++;
			}
		}
	}
	int ans = 1e9;
	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			if(a[i][j] == '#'){
				ans = min(ans, n - cnt1[j]);
				ans = min(ans, n + 1 - cnt1[i]);
			}
		}
	}
	if(ans > 1e8){
		puts("-1");
		return 0;
	}
	ans += n - count(cnt2, cnt2 + n, n);
	cout << ans << endl;
}

Submission Info

Judge Result