Submission #1131745

---

Source Code Expand

#include <bits/stdc++.h>

#define FOR(i,b,e) for(int i=(b); i <= (e); ++i)
#define FORD(i,b,e) for(int i=(b); i >= (e); --i)
#define SIZE(c) (int) (c).size()
#define FORE(i,c) FOR(i,0,SIZE(c)-1)
#define FORDE(i,c) FORD(i,SIZE(c)-1,0)

#define pb push_back
#define mp make_pair
#define st first
#define nd second


using namespace std;

typedef long long ll;
typedef pair <int,int> pii;
typedef pair <ll,ll> pll;

typedef vector <int> VI;
typedef vector <bool> VB;
typedef vector <pii> VP;
typedef vector <ll> VL;
typedef vector <pll> VPL;

typedef vector <VI> VVI;
typedef vector <VL> VVL;
typedef vector <VB> VVB;
typedef vector <VP> VVP;

const int MOD = 1000000007;
const int INF = 1000000001;
const ll LINF = 1000000000000000001LL;


/*************************************************************************/

int main() {
    ios_base::sync_with_stdio(0);
    
    int n;
    cin >> n;
    
    bool any = false;
    
    int tab[n][n];
    FOR(i,0,n-1) {
        string s;
        cin >> s;
        
        FOR(j,0,n-1) {
            tab[i][j] = (s[j] == '#');
            if (tab[i][j]) any = true;
        }
    }
    
    if (!any) {
        cout << -1;
        return 0;
    }
    
    int columnsNotFull = 0;
    FOR(j,0,n-1) {
        bool full = true;
        FOR(i,0,n-1) if (!tab[i][j]) full = false;
        
        if (!full) columnsNotFull++;
    }
    
    if (!columnsNotFull) {
        cout << 0;
        return 0;
    }
    
    int col[n];
    FOR(i,0,n-1) col[i] = 0;
    
    FOR(i,0,n-1) FOR(j,0,n-1) if (tab[i][j]) {
        col[j] = 1;
    }
    
    int best = INF;
    FOR(i,0,n-1) {
        int here = 0;
        FOR(j,0,n-1) if (!tab[i][j]) {
            here++;
        }
        
        if (!col[i]) {
            here++;
        }
        
        best = min(best, here);
    }
    
    cout << best + columnsNotFull;

    return 0;
}

/*************************************************************************/

Submission Info

Judge Result