Submission #434009

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cassert>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <complex>
#include <random>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;

const int MD = 1e9+7;

int dp[1<<20][25];
bool pri[5][5];
bool used[5][5];
int xp[25], yp[25];

int dfs(int p) {
    if (p == 25) {
        return 1;
    }
    if (xp[p] != -1) {
        int i = yp[p], j = xp[p];
        if (1 <= i && i <= 3) {
            if (used[i-1][j] && !used[i+1][j]) {
                return 0;
            }
            if (!used[i-1][j] && used[i+1][j]) {
                return 0;
            }
        }
        if (1 <= j && j <= 3) {
            if (used[i][j-1] && !used[i][j+1]) {
                return 0;
            }
            if (!used[i][j-1] && used[i][j+1]) {
                return 0;
            }
        }
        used[i][j] = true;
        int sm = dfs(p+1);
        used[i][j] = false;
        return sm;
    }

    int u = 0;
    int mp = 0;
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 5; j++) {
            if (pri[i][j]) continue;
            if (used[i][j]) {
                mp |= (1<<u);
            }
            u++;
        }
    }
    if (dp[mp][p] != -1) return dp[mp][p];

    int sm = 0;
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 5; j++) {
            if (pri[i][j]) continue;
            if (used[i][j]) continue;
            if (1 <= i && i <= 3) {
                if (used[i-1][j] && !used[i+1][j]) {
                    continue;
                }
                if (!used[i-1][j] && used[i+1][j]) {
                    continue;
                }
            }
            if (1 <= j && j <= 3) {
                if (used[i][j-1] && !used[i][j+1]) {
                    continue;
                }
                if (!used[i][j-1] && used[i][j+1]) {
                    continue;
                }
            }
            used[i][j] = true;
            sm += dfs(p+1);
            sm %= MD;
            used[i][j] = false;
        }
    }
    return dp[mp][p] = sm;
}

int main() {
    memset(xp, -1, sizeof(xp));
    memset(yp, -1, sizeof(yp));
    memset(dp, -1, sizeof(dp));
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 5; j++) {
            int d;
            cin >> d; d--;
            if (d != -1) {
                xp[d] = j;
                yp[d] = i;
                pri[i][j] = true;
            }
        }
    }
    cout << dfs(0) << endl;
    return 0;
}

Submission Info

Judge Result