Submission #1133354

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;

struct cww{cww(){
    ios::sync_with_stdio(false);cin.tie(0);
}}star;
#define fin "\n"
#define FOR(i,bg,ed) for(int i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define DEBUG if(0)
template <typename T>inline void chmin(T &l,T r){l=min(l,r);}
template <typename T>inline void chmax(T &l,T r){l=max(l,r);}
template <typename T>
istream& operator>>(istream &is,vector<T> &v){
    for(auto &it:v)is>>it;
    return is;
}
const int INF=114514;
int N;
char s[600][600];
int brack_row=0;
int solve(int r){
    int need=0;
    REP(i,N)need+=(s[r][i]=='.');
    int exist=0;
    REP(i,N)if(s[i][r]=='#')exist=1;
    if(exist==0){
        if(s[r][r]=='#')need++;
        need++;
    }
    return brack_row+need;
}

int main(){
    cin>>N;
    REP(i,N)cin>>s[i];
    int res=INF;
    int b=0;
    REP(i,N){
        int a=0;
        REP(j,N)if(s[j][i]=='.')a=1;else b=1;
        brack_row+=a;
    }
    if(b==0){
        cout<<-1<<endl;
        return 0;
    }
    REP(i,N)chmin(res,solve(i));
    cout<<res<<endl;
    return 0;
}

Submission Info

Judge Result