Submission #1587810

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
    each(x,vec) is >> x;
    return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    rep(i,vec.size()) {
        if (i) os << " ";
        os << vec[i];
    }
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
    rep(i,vec.size()) {
        if (i) os << endl;
        os << vec[i];
    }
    return os;
}
const ll mod = 1e9+7;
ll add(ll a, ll b) {
    if (a + b >= mod) return a + b - mod;
    return a + b;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    vector<vector<ll>> m(5, vector<ll>(5)); cin >> m;
    vector<P> pos(25, P(-1, -1));
    // vector<vector<ll>> nth(5, vector<ll>(5, -1));
    rep(y, 5) rep(x, 5) if (m[y][x]) pos[m[y][x]-1] = P(x, y);
    ll n = 0;
    vector<ll> nth_value;
    rep(i, 25) {
        if (pos[i].first < 0) {
            nth_value.pb(i);
            ++n;
        }
        // nth[pos[i].second][pos[i].first] = i;
    }
    vector<P> nth_pos;
    vector<vector<ll>> nth_pos_r(5, vector<ll>(5, -1));
    rep(y, 5) rep(x, 5) if (m[y][x] == 0) {
        nth_pos_r[y][x] = nth_pos.size();
        nth_pos.pb({x, y});
    }
    vector<ll> dp(1LL<<n, 0);
    dp[0] = 1;
    auto get = [&](ll f, ll val, ll x, ll y) {
        if (x < 0 || x >= 5 || y < 0 || y >= 5) return linf;
        if (nth_pos_r[y][x] < 0) return m[y][x]-1 < val ? 1LL : 0LL;
        return f & (1LL<<nth_pos_r[y][x]) ? 1LL : 0LL;
    };
    auto check = [&](ll f, ll val, ll x, ll y) {
        if (get(f, val, x-1, y) + get(f, val, x+1, y) == 1) return false;
        if (get(f, val, x, y-1) + get(f, val, x, y+1) == 1) return false;
        return true;
    };
    vector<ll> cunt(26, 0);
    rep(i, 25) cunt[i+1] = cunt[i] + (pos[i].first < 0);
    rep(i, 25) {
        rep(j, 1LL<<n) {
            if (cunt[i] != __builtin_popcount(j)) continue;
            if (dp[j] == 0) continue;
            ll val = i;
            if (pos[i].first < 0) {
                // cout << i << " " << j << endl;
                rep(k, n) {
                    if ((1LL<<k) & j) continue;
                    ll x, y; tie(x, y) = nth_pos[k];
                    if (!check(j, val, x, y)) continue;
                    ll nj = j | (1LL<<k);
                    dp[nj] = add(dp[nj], dp[j]);
                }
            }
            else {
                ll x, y; tie(x, y) = pos[i];
                if (!check(j, val, x, y)) dp[j] = 0;
            }
        }
    }
    cout << dp[(1LL<<n)-1] << endl;
}

Submission Info

Judge Result