Submission #1132452

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <algorithm>

#define mp make_pair
#define pb push_back

using namespace std;

typedef pair<int, int> pii;

const int MAXN = 1000;

string a[MAXN];

int main() {

    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i];

    {
        bool flag = false;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                if (a[i][j] != '.') {
                    flag = true;
                    break;
                }
        if (!flag) {
            cout << -1;
            return 0;
        }
    }

    int id = -1;
    int minw = 1e9;
    for (int i = 0; i < n; i++) {
        int white = 0;
        bool flag = false;
        for (int j = 0; j < n; j++)
            if (a[i][j] == '.')
                white++;

        for (int j = 0; j < n; j++)
            if (a[j][i] == '#') {
                flag = true;
                break;
            }

        if (!flag)
            white++;
        minw = min(white, minw);
        id = i;
    }

    for (int i = 0; i < n; i++) {
        bool flag = false;
        for (int j = 0; j < n; j++)
            if (a[j][i] == '.') {
                flag = true;
                break;
            }
        if (!flag)
            minw--;
    }
    if (id == -1)
        cout << -1;
    else
        cout << minw + n;

    return 0;
}

Submission Info

Judge Result