Submission #1590937

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <fstream>
#include <bitset>
#include <time.h>
#include <assert.h>
#include <unordered_map>

#define LL long long
#define VI vector<int>
#define VL vector<long long>
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define bitcount(b) __builtin_popcount(b)
const double EPS = 1e-10;
const double PI = acos(-1.0);
#define MOD 1000000007

using namespace std;


#define XY(x, y) (1 << ((y) * 5 + (x)))
bool can_set(int board, int pos) {
    int y = pos / 5;
    int x = pos % 5;

    if ((board & (1 << pos))) { return false; } // posに置かれてる
    if ((1 <= y && y <= 3) && (!(board & XY(x, y - 1)) ^ !(board & XY(x, y + 1)))) { return false; }    // 上下ともに置かれてるorともにおかれてない
    if ((1 <= x && x <= 3) && (!(board & XY(x - 1, y)) ^ !(board & XY(x + 1, y)))) { return false; }    // 左右ともに置かれてるorともにおかれてない
    return true;
}

int dp[1 << 25] = {0};
int main(int argc, char *argv[]) {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N = 5 * 5;
    vector<int> field(N, -1);   // i が j マス目においてある
    int used = 0;
    FOR(i, 0, N) {
        int x;
        cin >> x;
        if (x != 0) {
            field[x - 1] = i;
            used |= 1 << i;
        }
    }

    dp[0] = 1;
    FOR(board, 0, 1 << N) {
        if (dp[board] == 0) { continue; }

        int n = bitcount(board); // 次に置く数値

        // 場所が決まってる
        if (field[n] != -1) {
            if (!can_set(board, field[n])) { continue; }
            int new_board = board | (1 << field[n]);
            dp[new_board] = (dp[new_board] + dp[board]) % MOD;
        }
        else {
            FOR(j, 0, N) {
                if ((used & (1 << j)) == 1) { continue; }
                if (!can_set(board, j)) { continue; }
                int new_board = board | (1 << j);
                dp[new_board] = (dp[new_board] + dp[board]) % MOD;
            }
        }
    }

    cout << dp[(1 << N) - 1] << endl;
    return 0;
}

Submission Info

Judge Result