Submission #434072

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

inline bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }

typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef long long ll;
typedef unsigned long long ull;

#define For(i,a,b)	for(int (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))
#define Fill(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

const int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int mod = 1000000007;
const int INF = 1e9;

int d[5][5];
int m[26];

int dfs(int y,int x){
	
	int ret = 0;
	For(i, 1, 26){
		if (!m[i]){

			if (y > 0 && y < 4){
				if (d[y - 1][x] != 0 && d[y + 1][x] != 0)
				if (d[y - 1][x] < i && i < d[y + 1][x])continue;
				if (d[y - 1][x] > i && i > d[y + 1][x])continue;
			}
			if (x > 0 && x < 4){
				if (d[y][x - 1] != 0 && d[y][x + 1] != 0)
				if (d[y][x - 1] < i && i < d[y][x + 1])continue;
				if (d[y][x - 1] > i && i > d[y][x + 1])continue;
			}
			if (y > 1 && y < 5){
				if (d[y - 2][x] != 0 && d[y - 1][x] != 0)
				if (d[y - 2][x] < d[y - 1][x] && d[y - 1][x] < i)continue;
				if (d[y - 2][x] > d[y - 1][x] && d[y - 1][x] > i)continue;
			}
			if (x > 1 && x < 5){
				if (d[y][x - 2] != 0 && d[y][x - 1] != 0)
				if (d[y][x - 2] < d[y][x - 1] && d[y][x - 1] < i)continue;
				if (d[y][x - 2] > d[y][x - 1] && d[y][x - 1] > i)continue;
			}
			if (y >= 0 && y < 3){
				if (d[y + 2][x] != 0 && d[y + 1][x] != 0)
				if (d[y + 2][x] < d[y + 1][x] && d[y + 1][x] < i)continue;
				if (d[y + 2][x] > d[y + 1][x] && d[y + 1][x] > i)continue;
			}
			if (x >= 0 && x < 3){
				if (d[y][x + 2] != 0 && d[y][x + 1] != 0)
				if (d[y][x + 2] < d[y][x + 1] && d[y][x + 1] < i)continue;
				if (d[y][x + 2] > d[y][x + 1] && d[y][x + 1] > i)continue;
			}

			d[y][x] = i;
			m[i] = 1;
			bool f = true;
			For(j,0, 5)For(k,0, 5){
				if (d[j][k] == 0){
					f = false;
					ret += dfs(j, k);
					goto BREAK;
				}
			}
		BREAK:;
			if (f)
				ret++;
			m[i] = 0;
			d[y][x] = 0;
		}
	}

	return ret;
}

int main()
{
	int T = 0;
	rep(i, 5)rep(j, 5){
		cin >> d[i][j];
		if (d[i][j]){
			m[d[i][j]] = 1;
			T++;
		}
	}

	ll sum0 = 1;
	For(i, 1, 26){
		sum0 = (sum0 * i) % mod;
	}

	int sum1 = 0;
	rep(i, 5)rep(j, 5){
		if (d[i][j] == 0){
			sum1 = dfs(i, j) % mod;
			break;
		}
	}
	int sum = sum0 - sum1;
	int ans = ((sum % mod) < 0 ? (sum % mod + mod) : (sum % mod));
	if (T == 25)sum1 = 1;
	cout << sum1 << endl;

	return 0;
}

Submission Info

Judge Result