Ruudukko

#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
int main() {
	const int MOD = 1e9 + 7;
	// size
	int size;
	cin >> size;
	// boxes
	int box_y[size][size];
	int box_x[size][size];
	vector<pair<int,pair<int,int>>> sbox;
	int i;
	for (int y=0; y < size; y++) {
		for (int x=0; x < size; x++) {
			cin >> i;
			box_y[y][x] = i;
			box_x[x][y] = i;
			sbox.push_back({i, {x, y}});
		}
	}
	// preparation
	int paths[size][size] = {};
	int total_paths = 0;
	sort(sbox.begin(), sbox.end());
	// main loop
	int px, py;
	for (auto p : sbox) {
		px = p.second.first;
		py = p.second.second;
		total_paths = (++paths[py][px] + total_paths) % MOD;
		// bigger things
		for (int y=0; y < size; y++) {
			if (box_x[px][y] > p.first) {
				paths[y][px] = (paths[y][px] + paths[py][px]) % MOD;
			};
		}
		for (int x=0; x < size; x++) {
			if (box_y[py][x] > p.first) {
				paths[py][x] = (paths[py][x] + paths[py][px]) % MOD;
			};
		}
	}
	cout << total_paths << "\n";
}
 

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