Submission #1758700

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long int ll;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EREP(i, n) for (int i = (n - 1); i >= 0; --i)
#define mod 1000000007
#define INF 93193111451418101
#define MIN -93193111451418101
//#define INF 931931114518101
using namespace std;
typedef pair<ll, ll> P;
template <typename T> void fill_all(T &arr, const T &v) { arr = v; }
template <typename T, typename ARR> void fill_all(ARR &arr, const T &v) {
  for (auto &i : arr) {
    fill_all(i, v);
  }
}
#define yo 100001
//------------------変数-----------------------//
ll grid[26];
int dp[1 << 25];
map<ll, ll> selected;
//-------------------関数----------------------//

int main() {
  REP(i, 25) {
    cin >> grid[i];
    if (grid[i]) {
      selected[grid[i]] = i + 1;
    }
  }
  dp[0] = 1;
  REP(i, (1 << 25) - 1) {
    if (!dp[i])
      continue;
    ll flagcnt = __builtin_popcount(i) + 1; //どの整数まで数えたか
    if (selected[flagcnt]) {
      ll x = selected[flagcnt] - 1;
      ll y = x / 5;
      x %= 5;
      ll place = selected[flagcnt] - 1;
      if (x > 0 && x < 4 && ((i >> (place - 1)) ^ (i >> (place + 1))) & 1)
        continue;
      if (y > 0 && y < 4 && ((i >> (place - 5)) ^ (i >> (place + 5))) & 1)
        continue;
      (dp[i | (1 << place)] += dp[i]) %= mod;
    } else {
      REP(j, 25) {
        if (grid[j] || i >> j & 1) {
          continue;
        }
        ll x = j;
        ll y = x / 5;
        x %= 5;
        ll place = j;
        if (x > 0 && x < 4 && ((i >> (place - 1)) ^ (i >> (place + 1))) & 1)
          continue;
        if (y > 0 && y < 4 && ((i >> (place - 5)) ^ (i >> (place + 5))) & 1)
          continue;
        (dp[i | (1 << place)] += dp[i]) %= mod;
      }
    }
  }
  cout << dp[(1 << 25) - 1];
  return 0;
}

Submission Info

Judge Result