Submission #1135008

---

Source Code Expand

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

#define forn(i,n) for(int i=0;i<(int)(n);i++)
#define si(c) ((int)(c).size())
#define forsn(i,s,n) for(int i = (int)(s); i<((int)n); i++)
#define dforsn(i,s,n) for(int i = (int)(n)-1; i>=((int)s); i--)
#define all(c) (c).begin(), (c).end()
#define D(a) cerr << #a << "=" << a << endl;
#define pb push_back
#define eb emplace_back
#define mp make_pair

typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> pii;

const int N = 555;

int n, total, col[N], row[N];
string a[N];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin >> n;
    forn(i,n) cin >> a[i];

    int needCols = n;
    forn(i,n) forn(j,n) {
        bool black = a[i][j] == '#';
        row[i] += black;
        col[j] += black;
        if (col[j] == n) needCols--;
        total += black;
    }

    if (total == 0) cout << -1 << endl;
    else {
        int needRow = n;
        forn(i,n) needRow = min(needRow, n - row[i] + (col[i] == 0));
        cout << needRow + needCols << endl;
    }
    return 0;
}

Submission Info

Judge Result