Submission #433256

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cassert>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <complex>
#include <random>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;


int d[5][5];
int used[25];

int dfs(int x, int y) {
    if (y == 5) return 1;
    if (x == 5) return dfs(0, y+1);
    if (d[y][x] != -1) {
        bool f = true;
        if (2 <= x) {
            if (d[y][x-2] < d[y][x-1] && d[y][x-1] < d[y][x]) {
                f = false;
            }
            if (d[y][x-2] > d[y][x-1] && d[y][x-1] > d[y][x]) {
                f = false;
            }
        }
        if (2 <= y) {
            if (d[y-2][x] < d[y-1][x] && d[y-1][x] < d[y][x]) {
                f = false;
            }
            if (d[y-2][x] > d[y-1][x] && d[y-1][x] > d[y][x]) {
                f = false;
            }
        }
        if (!f) return 0;
        return dfs(x+1, y);
    }
    int sm = 0;
    for (int i = 0; i < 25; i++) {
        if (used[i]) continue;
        d[y][x] = i;
        used[i] = true;
        bool f = true;
        if (2 <= x) {
            if (d[y][x-2] < d[y][x-1] && d[y][x-1] < d[y][x]) {
                f = false;
            }
            if (d[y][x-2] > d[y][x-1] && d[y][x-1] > d[y][x]) {
                f = false;
            }
        }
        if (2 <= y) {
            if (d[y-2][x] < d[y-1][x] && d[y-1][x] < d[y][x]) {
                f = false;
            }
            if (d[y-2][x] > d[y-1][x] && d[y-1][x] > d[y][x]) {
                f = false;
            }
        }
        if (f) {
            sm += dfs(x+1, y);
        }
        d[y][x] = -1;
        used[i] = false;
    }
    return sm;
}

int main() {
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 5; j++) {
            cin >> d[i][j]; d[i][j]--;
            if (d[i][j] != -1) {
                used[d[i][j]] = true;
            }
        }
    }
    cout << dfs(0, 0) << endl;
    return 0;
}

Submission Info

Judge Result