Ruudukko

#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>

using namespace std;
int n;
vector<int> table;
set<int> numbers;
map<int, set<int>> numberLocations;
map<int, int> hashTable;

bool areConnected(int a, int b) {
    return ((a - b) % n == 0) || (a/n == b/n);
}

set<int> allConnectedCells(int a) {
    set<int> connectedCells;
    for (int i=0; i<n; i++) {
        connectedCells.insert(n*i + (a % n));
        connectedCells.insert(a - (a % n) + i);
    }

    return connectedCells;
}

int countPaths(int i) {
    int total = 0;
    if (hashTable.count(i) != 0)
        total = hashTable[i];
    else {
        set<int> connectedCells = allConnectedCells(i);
        for (int cell: connectedCells) {
            if (table[cell] < table[i]) // connected per the rule
                total += countPaths(cell) + 1; 
        }
        hashTable[i] = total;
    }
    return total % 1000000007;
}

int main() {
    int k;
    cin >> n;

    
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            cin >> k;
            numbers.insert(k);
            table.push_back(k);
            if (numberLocations.count(k) == 0) {
                numberLocations[k] = set<int>();
            }
            numberLocations[k].insert(n*i+j);
        }
    }
    int total = n*n;
    for (auto k: numbers) {
        for (auto i: numberLocations[k]) {
            total += countPaths(i);
            total = total % 1000000007;
        }
    }
    cout << total;

}

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: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED