Submission #2071526

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const ll mod = 1000000007;
int a[25][25], b[25][25];
vector<pii> ps;
set<int> st;
vector<int> ns;

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  
  for (int i = 0; i < 5; i++) {
    for (int j = 0; j < 5; j++) {
      cin >> a[i][j];
      if (a[i][j] == 0) ps.push_back(pii(i, j));
      else st.insert(a[i][j]);
    }
  }
  for (int i = 1; i <= 25; i++) {
    if (st.find(i) == st.end()) ns.push_back(i);
  }
  assert(ns.size() <= 8);

  ll ans = 0;
  do {
    memcpy(b, a, sizeof(a));
    for (int i = 0; i < ns.size(); i++) {
      pii p = ps[i];
      b[p.first][p.second] = ns[i];
    }
    bool ok = true;
    for (int i = 0; i < 5; i++) {
      for (int j = 1; j < 4; j++) {
        ok &= (!(b[i][j - 1] < b[i][j] && b[i][j] < b[i][j + 1]) && !(b[i][j - 1] > b[i][j] && b[i][j] > b[i][j + 1]));
      }
    }
    for (int j = 0; j < 5; j++) {
      for (int i = 1; i < 4; i++) {
        ok &= (!(b[i - 1][j] < b[i][j] && b[i][j] < b[i + 1][j]) && !(b[i - 1][j] > b[i][j] && b[i][j] > b[i + 1][j]));
      }
    }
    ans += ok;
    ans %= mod;
  } while (next_permutation(ns.begin(), ns.end()));
  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result