Ruudukko

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;

public class D430 {

	static final long mod = 1000000007;

	static boolean stop = false;
	
	static int n;
	static int c = 0;
	static int[][] grid;

	public static void main(String[] args) {
		FastReader reader = new FastReader();
		PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));

		n = reader.nextInt();
		grid = new int[n][n];

		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++)
				grid[i][j] = reader.nextInt();
		reader.close();

		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++) {
				if (grid[i][j] == 1)
					continue;
				// System.out.println("--------");
				// System.out.println("Solving for " + grid[i][j]);
				c += solve(i, j) % mod;
			}

		writer.println(c);
		writer.flush();
		writer.close();
	}

	/*-
	 * GRID HAS X, Y
	 * 
	 *        x ->
	 * 		0 1 2
	 *   y	1 A B
	 * 	 ⬇  2 C D
	 */

	static int solve(int y, int x) {
		int currValue = grid[y][x];
		int solutions = 0;

		if (currValue == 1) return 0;
		// System.out.println("Solving " + currValue);
		
		
		for (int i = 0; i < n; i++) {
			// System.out.println("(" + currValue + ") Running search " + i);
			int value1 = grid[y][i];
			int value2 = grid[i][x];

			if (value1 < currValue) {
				// System.out.println("Found a smaller value horizontally (" + y + "," + i +") : " + value1);
				solutions += solve(y, i) + 1;
			}
			if (value2 < currValue) {
				// System.out.println("Found a smaller value vertically (" + + i + "," + x + ") : " + value2);
				solutions += solve(i, x) + 1;
			}
			
		}
		
		if (solutions == 0) return 1;
		
		// System.out.println("Total solutions found: " + solutions);

		return solutions;
	}

	static class FastReader {

		private BufferedReader br;
		private StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
				e.printStackTrace();
			}
			st = null;
			br = null;
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		String nextLine() {
			String str = "";

			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}

			return str;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		BigInteger nextBigInteger() {
			return new BigInteger(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

	}

}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 2, 3

Verdict: WRONG ANSWER

Test 5

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: WRONG ANSWER

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED