Ruudukko

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;
 
public class D4301 {
 
	static final long mod = 1000000007;
 
	static int n;
	static long c = 0;
	static long[][] grid;
	static long[][] dp;
 
	public static void main(String[] args) throws FileNotFoundException {
		FastReader reader = new FastReader();
		PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));
 
		n = reader.nextInt();
		grid = new long[n][n];
		dp = new long[n][n];
 
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++) {
				grid[i][j] = reader.nextLong();
			}
 
		reader.close();
 
		c += n * n;
 
		for (int y = n-1; y > -1; y--)
			for (int x = n - 1; x > -1; x--) {
				if (grid[y][x] == 1) {
					dp[y][x] = 1;
					continue;
				}
				c += (sumFrom(y, x)) % mod;
			}
 
		if (c == 0) c = 1;
 
		writer.println(c);
		writer.flush();
		writer.close();
	}
 
	static long sumFrom(int y, int x) {
		if (dp[y][x] != 0) return dp[y][x];
 
		long value = grid[y][x];
		long sum = 0;
 
		for (int i = 0; i < n; i++) {
			long horizontal = grid[y][i];
			long vertical = grid[i][x];
			
			if (vertical < value) {
				if (vertical == 1) {
					sum += 1;
				} else {
					sum += (sumFrom(i, x) + 1);
				}
			}
			if (horizontal < value) {
				if (horizontal == 1) {
					sum += 1;
				} else {
					sum += (sumFrom(y, i) + 1);
				}
			}
		}
 
		dp[y][x] = sum;
		return sum;
	}
 
	static class FastReader {
 
		private BufferedReader br;
		private StringTokenizer st;
 
		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		public FastReader(InputStream in) {
			br = new BufferedReader(new InputStreamReader(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: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 2, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED