Submission #1131443

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
typedef long long lint;
const int mod = 1e9 + 7;

int n;
char a[505][505];

int main(){
	cin >> n;
	bool ok = 0;
	for(int i=0; i<n; i++){
		cin >> a[i];
		if(count(a[i], a[i] + n, '#') > 0) ok = 1;
	}
	if(!ok){
		puts("-1");
		return 0;
	}
	int ans = 1e9;
	for(int i=0; i<n; i++){
		bool fnd = 0, fnd2 = 0;
		int tmp = 0;
		for(int j=0; j<n; j++){
			if(a[j][i] == '#'){
				if(count(a[j], a[j] + n, '.') == 0){
					fnd2 = 1;
				}
				fnd = 1;
			}
		}
		int full = 0;
		for(int j=0; j<n; j++){
			if(a[i][j] == '.') tmp++;
			bool bad = 0;
			for(int k=0; k<n; k++){
				if(a[k][j] == '.') bad = 1;
			}
			if(!bad) full++;
		}
		if(fnd2){
			ans = min(ans, n - full);
		}
		else{
			ans = min(ans, tmp + n - full);
		}
	}
	cout << ans << endl;
}

Submission Info

Judge Result