Submission #433450

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int R = 5;
const int C = 5;

int x[R][C];
int used[30], used2[30];
int ans;

void rec(int i, int j) {
  if(j == C) ++i, j = 0;
  if(i == R) {
    ++ans; return;
  }
  int l = 1, r = 25;
  if(j >= 2) {
    if(x[i][j-2] < x[i][j-1]) r = x[i][j-1] - 1;
    else l = x[i][j-1] + 1;
  }
  if(i >= 2) {
    if(x[i-2][j] < x[i-1][j]) r = min(r, x[i-1][j] - 1);
    else l = max(l, x[i-1][j] + 1);
  }
  if(x[i][j]) l = max(l, x[i][j]), r = min(r, x[i][j]);
  for(int k = l; k <= r; ++k) {
    if(x[i][j] != k && used2[k]) continue;
    if(used[k]) continue;
    int tmp = x[i][j];
    x[i][j] = k;
    used[k] = 1;
    bool flag = false;
    if(i == 0 || i+1 == R) {
      flag = true;
    } else {
      int nl = 1, nr = 25;
      if(x[i-1][j] < x[i][j]) nr = x[i][j] - 1;
      else nl = x[i][j] + 1;
      if(x[i+1][j]) nl = max(nl, x[i+1][j]),nr = min(nr, x[i+1][j]);
      for(int d = nl; d <= nr; ++d) {
        if(!used[d]) {
          flag = true;
          break;
        }
      }
    }
    if(flag) rec(i, j+1);
    x[i][j] = tmp;
    used[k] = 0;
  }
}

int main() {
  memset(used2, 0, sizeof(used2));
  for(int i = 0; i < R; ++i) {
    for(int j = 0; j < C; ++j) {
      cin >> x[i][j];
      used2[x[i][j]] = 1;
    }
  }
  memset(used, 0, sizeof(used));
  ans = 0;
  rec(0, 0);
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result