提出 #17532729

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define ll128 __uint128_t
#define ld long double
#define pll pair <ll, ll>

#define vll vector <ll>
#define vld vector<ld>
#define vpll vector<pll>

#define vvll vector <vll>

#define rep(i, a, b) for(ll i = (ll)a; i < (ll)b; i++)
#define per(i, a, b) for(ll i = (ll)a - 1; i >= (ll)b; --i)

#define endl "\n"
#define pb push_back
#define pf push_front

#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()

#define sorta(v) sort(all(v))
#define sortd(v) sort(rall(v))

#define debug if (1)
#define log(val) debug {cout << "\n" << #val << ": " << val << "\n";}

#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define file(name) freopen(name".in", "r", stdin); freopen(name".out", "w", stdout);
#define FILE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);

#define mod (ll)(1e9 + 7)
#define inf (mod * mod)

using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;

ostream & operator << (ostream & out, vll & a) {
    for(auto i : a) out << i << " ";
    return out;
}

istream & operator >> (istream & in, vll & a) {
    for(auto &i : a) in >> i;
    return in;
}

const ll N = 505;
char a[N][N];
ll cnt[N];
ll cntFull = 0;

int main() {
    ll n;
    cin >> n;

    rep(i, 0, n) {
        rep(j, 0, n) {
            cin >> a[i][j];
            if (a[i][j] == '#') {
                cnt[i]++;
            }
        }
    }
    ll uu = 0;
    rep(j, 0, n) {
        ll oo = 0;
        rep(i, 0, n) {
            oo |= (a[i][j] == '.');
            uu |= (a[i][j] == '#');
        }
        if (!oo) cntFull++;
    }
    if (!uu) return cout << -1, 0;
    ll ans = 1e9;
    rep(j, 0, n) {
        rep(i, 0, n) {
            if (a[i][j] == '#') {
                ans = min(ans, n - cnt[j]);
            }
        }
        ans = min(ans, n - cnt[j] + 1);
    }

    if (ans == 1e9) return cout << -1, 0;

    cout << ans + n - cntFull << endl;



    return 0;
}

提出情報

ジャッジ結果