Submission #1131824

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long LL;
typedef pair<int, int> PII;

int n;
string s[500];

int main() {
    ios_base::sync_with_stdio(false);
    cin >> n;
    forn(i, n) {
        cin >> s[i];
    }
    bool dots = true;
    forn(i, n) {
        forn(j, n) if (s[i][j] == '#') {
            dots = false;
            break;
        }
        if (!dots) {
            break;
        }
    }
    if (dots) {
        cout << -1 << endl;
        return 0;
    }
    forn(i, n) {
        bool ok = true;
        forn(j, n) if (s[i][j] != '#') {
            ok = false;
            break;
        }
        if (ok) {
            int bad = 0;
            forn(i, n) {
                forn(j, n) if (s[j][i] != '#') {
                    ++bad;
                    break;
                }
            }
            cout << bad << endl;
            return 0;
        }
    }
    int cols = 0;
    forn(i, n) {
        forn(j, n) if (s[j][i] != '#') {
            ++cols;
            break;
        }
    }
    int best = n + cols;
    forn(i, n) {
        int need = 0;
        forn(j, n) if (s[i][j] != '#') {
            ++need;
        }
        if (need == n) {
            continue;
        }
        bool bad = true;
        forn(j, n) if (s[j][i] == '#') {
            bad = false;
            break;
        }
        if (bad) {
            ++need;
        }
        best = min(best, need + cols);
    }
    cout << best << endl;
    return 0;
}

Submission Info

Judge Result