Submission #1697201

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef pair<double,int>Q;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int n,m; string f[505];
int main(){
	cin>>n;
	rep(i,n)cin>>f[i];
	int ans = INF;
	rep(i,n){
		int cnt = 0;
		rep(j,n) cnt+=f[i][j]=='#';
		if(cnt == 0) continue;
		int ret = n-cnt; cnt = 0;
		rep(j,n) cnt += f[j][i]=='#';
		if(cnt == 0) ret++;
		rep(j,n){
			rep(i,n) if(f[i][j]=='.') {ret++;break;}
		}
		ans=min(ans,ret);
	}
	if(ans>1e8) ans=-1;
	cout<<ans<<endl;
}

Submission Info

Judge Result