Submission #1383311

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;
ll MOD = 1e9+7;
//LLONG_MIN

//まっさらかどうかのフラグ
//j列目に#があるかどうかを記録
//i列目について，白の箇所kを確認して，列kに#があるかどうか見て，あるなら(白の個数)，ないなら(白の個数+1)


int main(void){
	int N,white_number[301],white_exist_number=0;
	bool all_white=true,black[301],white[301];
	ll ans=LLONG_MAX;
	char a[301][301];
	cin>>N;
	rep(i,N){
		white_number[i]=0;
		rep(j,N){
			cin>>a[i][j];
			if(a[i][j]=='#'){
				all_white = false;
			}else{
				white_number[i]++;
			}
		}

	}
	if(all_white){
		cout<<-1<<endl;
	}else{
		rep(j,N){
			black[j]=false;//黒がある
			white[j]=false;//白がある
			rep(i,N){
				if(a[i][j]=='#'){
					black[j]=true;
				}else{
					white[j]=true;
				}
			}
			if(white[j])white_exist_number++;
		}
		rep(i,N)if(black[i]){
			if(ans>white_number[i])ans=white_number[i];
		}else{
			if(ans>white_number[i]+1)ans=white_number[i]+1;
		}
		cout<<ans+white_exist_number<<endl;
	}

	return 0;
}

Submission Info

Judge Result