Submission #433257

---

Source Code Expand

import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		HashSet<Integer> al = new HashSet<>();
		for(int i=1;i<=25;i++) {
			al.add(i);
		}
		ArrayList<Integer> ei = new ArrayList<>();
		ArrayList<Integer> ej = new ArrayList<>();
		Scanner sc = new Scanner(System.in);
		int[][] m = new int[5][5];
		for(int i=0;i<5;i++) {
			for(int j=0;j<5;j++) {
				m[i][j] = sc.nextInt();
				al.remove(m[i][j]);
				if (m[i][j] == 0) {
					ei.add(i);
					ej.add(j);
				}
			}
		}
		int n = al.size();
		if (n > 8) {
			throw new RuntimeException();
		}
		Integer[] pp = al.toArray(new Integer[0]);
		int[] p = new int[n];
		for(int i=0;i<n;i++) {
			p[i] = pp[i];
		}
		int ans = 0;
		do {
			for(int i=0;i<n;i++) {
				m[ei.get(i)][ej.get(i)] = p[i];
			}
			if (isValid(m)) {
				ans++;
			}
		} while (nextPermutation(p));
		System.out.println(ans);
	}

	public static boolean isValid(int[][] m) {
		for(int i=0;i<3;i++) {
			for(int j=0;j<5;j++) {
				if (m[i][j] < m[i+1][j] && m[i+1][j] < m[i+2][j]) {
					return false;
				}
				if (m[i][j] > m[i+1][j] && m[i+1][j] > m[i+2][j]) {
					return false;
				}
			}
		}
		for(int i=0;i<5;i++) {
			for(int j=0;j<3;j++) {
				if (m[i][j] < m[i][j+1] && m[i][j+1] < m[i][j+2]) {
					return false;
				}
				if (m[i][j] > m[i][j+1] && m[i][j+1] > m[i][j+2]) {
					return false;
				}
			}
		}
		return true;
	}

	static boolean nextPermutation(int[] p) {
		for(int a=p.length-2;a>=0;--a) {
			if(p[a]<p[a+1]) {
				for(int b=p.length-1;;--b) {
					if(p[b]>p[a]) {
						int t = p[a];
						p[a] = p[b];
						p[b] = t;
						for(++a, b=p.length-1;a<b;++a,--b) {
							t = p[a];
							p[a] = p[b];
							p[b] = t;
						}
						return true;
					}
				}
			}
		}
		return false;
	}

}

Submission Info

Judge Result