Submission #433425

---

Source Code Expand

#include <stdio.h>

#define M 1000000007

int n[5][5];

int check(int y,int x) {
	if(y<3) {
		if(n[y][x]<n[y+1][x] && n[y+1][x]<n[y+2][x])return 0;
		if(n[y][x]>n[y+1][x] && n[y+1][x]>n[y+2][x])return 0;
	}
	if(x<3) {
		if(n[y][x]<n[y][x+1] && n[y][x+1]<n[y][x+2])return 0;
		if(n[y][x]>n[y][x+1] && n[y][x+1]>n[y][x+2])return 0;
	}
	return 1;
}

int count(int y,int x,int available) {
	int i;
	int ret=0;
	if(x<0) {
		y--;
		x+=5;
	}
	if(y<0)return 1;
	if(n[y][x]>0) {
		if(check(y,x)) {
			ret=count(y,x-1,available);
		}
	} else {
		for(i=1;i<=25;i++) {
			if(available & (1<<(i-1))) {
				n[y][x]=i;
				if(check(y,x)) {
					ret+=count(y,x-1,available & ~(1<<(i-1)));
					if(ret>=M)ret-=M;
				}
				n[y][x]=0;
			}
		}
	}
	return ret;
}

int main(void) {
	int i,j;
	int available = (1<<25)-1;
	for(i=0;i<5;i++) {
		for(j=0;j<5;j++) {
			if(scanf("%d",&n[i][j])!=1)return 1;
			if(n[i][j]>0)available&=~(1<<(n[i][j]-1));
		}
	}
	printf("%d\n",count(4,4,available));
	return 0;
}

Submission Info

Judge Result