Ruudukko

#include <iostream>
#include <chrono>
#include <map>

using namespace std;


int RoutesFromPoint(int* grid[], int gridSize, int x, int y, map<string, long> &memo){
    if(grid[x][y] == 1){ return 1; }
    string key = std::to_string(x) + "-" + std::to_string(y);
    if (memo.count(key)){
        return memo[key];
    }

    long totalCount = 1;
    for (int x2 = 0; x2 < gridSize; x2++){
        if (grid[x2][y] < grid[x][y]){
            totalCount += RoutesFromPoint(grid, gridSize, x2, y, memo);
        }
    }
    for (int y2 = 0; y2 < gridSize; y2++){
        if (grid[x][y2] < grid[x][y]){
            totalCount += RoutesFromPoint(grid, gridSize, x, y2, memo);
        }
    }
    memo[key] = totalCount;
    return totalCount  % 1000000007;
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);


    // INPUT
    int gridSize;
    cin >> gridSize;
    int* grid[gridSize];
    for (int i = 0; i < gridSize; i++){
        grid[i] = new int[gridSize];
    }

    for (int y = 0; y < gridSize; y++){
        for (int x = 0; x < gridSize; x++){
            cin >> grid[x][y];
        }
    }

    //auto start = std::chrono::high_resolution_clock::now();

    // ALG
    long totalCount = 0;
    map<string, long> memo = map<string, long>();
    for (int y = 0; y < gridSize; y++){
        for (int x = 0; x < gridSize; x++){
            totalCount += RoutesFromPoint(grid, gridSize, x, y, memo);
        }
    }

    //auto end = std::chrono::high_resolution_clock::now();
    //cout << "TIME: " << std::chrono::duration_cast<std::chrono::milliseconds>(end-start).count() / 1000.0 << "\n"; 
    
    cout << (totalCount % 1000000007);
}
    

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