Ruudukko

#include<iostream>

using namespace std;
const int MOD = 1000000007;

int board[1000][1000];
long long int memo[1001][1001];
int n;

int recurse(int x, int y); 

int main() {
	cin >> n;

	for (int i=0; i<n; i++) {
		for (int j=0; j<n; j++) {
			cin >> board[i][j];
		}
	}

	long long int sum = 0;
	//for future, maybe somehow sort the rows and cols and go from there
	for (int i=0; i<n; i++) {
		for (int j=0; j<n; j++) {
			if (memo[i][j] != 0) {
				sum += memo[i][j];
			} else {
				sum += recurse(i, j);
			}
			sum %= MOD;
		}
	}

	cout << sum << endl;

}

int recurse(int x, int y) {
	if (memo[x][y] != 0) {
		return memo[x][y];
	}

	int current = board[x][y];
	long long int sum = 1;
	for (int i=0; i<n; i++) {
		if (current > board[i][y]) {
			sum += recurse(i, y);	
		}
	}

	for (int i=0; i<n; i++) {	
		if (current > board[x][i]) {
			sum += recurse(x, i);	
		}
	}

	sum %= MOD;
	memo[x][y] = sum;
	return sum;
}

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: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED