Submission #1370288

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

int dp[1<<25], pos[26];

bool valid(int bit, int p) {
    if(bit >> p & 1) return false;
    int x = p/5, y = p%5;
    if(x > 0 && x < 4 && ((bit >> (p-5))^(bit >> (p+5))) & 1) return false;
    if(y > 0 && y < 4 && ((bit >> (p-1))^(bit >> (p+1))) & 1) return false;
    return true;
}

signed main() {
    memset(pos, -1, sizeof(pos));
    vector<int> v;
    rep(i,0,25) {
        int n; cin >> n;
        if(n) pos[n] = i;
        else v.push_back(i);
    }

    dp[0] = 1;
    rep(bit,0,1<<25) {
        int i = __builtin_popcount(bit) + 1;
        if(pos[i] != -1) {
            if(valid(bit, pos[i])) {
                int nbit = bit | (1 << pos[i]);
                (dp[nbit] += dp[bit]) %= MOD;
            }
        }
        else {
            for(auto to : v) {
                if(valid(bit, to)) {
                    int nbit = bit | (1 << to);
                    (dp[nbit] += dp[bit]) %= MOD;
                }
            }
        }
    }
    cout << dp[(1<<25)-1] << endl;
    return 0;
}

Submission Info

Judge Result