Submission #1131295

---

Source Code Expand

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
const ld TAU=2*acos(-1);
const ld eps=1e-7;
const int inf=1e9+99;
const ll linf=1e18+88;
const int P=1e9+7;


string a[512];
int row_ct[512],col_ct[512];

int32_t main() {
	int n; cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	bool poss=0;
	for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(a[i][j]=='#') {
		++row_ct[i];
		++col_ct[j];
		poss=1;
	}
	if(!poss) return cout<<-1<<endl,0;

	for(int i=0;i<n;i++) if(row_ct[i]==n) {
		int Z=0;
		for(int j=0;j<n;j++) if(col_ct[j]!=n) ++Z;
		return cout<<Z<<endl,0;
	}
	int be=inf;
	for(int i=0;i<n;i++) if(col_ct[i]>0) {
		int Z=n-row_ct[i];
		for(int j=0;j<n;j++) if(col_ct[j]!=n) ++Z;
		be=min(Z,be);
	}
	cout<<be<<endl;
}

Submission Info

Judge Result