Submission #1132865

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
//typedef long long int LL;
typedef vector<int> ivec;
typedef vector<string> svec;

int beki(int x){
         if(x==0)return 1;
	 else return 2*beki(x-1);
}

string s[1000];
int MAP[600][600];
int yoko[600];
int tate[600];
int a[1000];
int main(){
    int n;
    int yokomax=0;
    int tatecomp=0;
    int ans=100000000;
    bool flag=0;
    cin>>n;
    int sum=0;
    for(int i=0;i<n;i++){
        cin>>s[i];
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
	    if(s[i][j]=='#')MAP[i][j]=1,yoko[i]++,tate[j]++,flag=1;
	    else MAP[i][j]=0;
        }
	if(yokomax<yoko[i])yokomax=yoko[i];
    }	
    if(!flag){
       cout<<-1<<endl;
       return 0;
    }   
    for(int i=0;i<n;i++){
        if(tate[i]==n)tatecomp++;
    }
    for(int i=0;i<n;i++){
        if(tate[i]!=0)ans=min(ans,n-yoko[i]);
	if(tate[i]==0)ans=min(ans,n-yoko[i]+1);
	
    }
    //if(ans==100000000)cout<<-1<<endl;
    cout<<ans+n-tatecomp<<endl;
    return 0;
}

Submission Info

Judge Result