Ruudukko

input/code.cpp: In function 'uint32_t GetRouteCount(int, int)':
input/code.cpp:27:26: warning: comparison of integer expressions of different signedness: 'int' and 'uint32_t' {aka 'unsigned int'} [-Wsign-compare]
   27 |     for(int i = y + 1; i < n; i++)
      |                        ~~^~~
input/code.cpp:37:26: warning: comparison of integer expressions of different signedness: 'int' and 'uint32_t' {aka 'unsigned int'} [-Wsign-compare]
   37 |     for(int i = x + 1; i < n; i++)
      |                        ~~^~~
input/code.cpp:42:26: warning: comparison of integer expressions of different signedness: 'int' and 'uint32_t' {aka 'unsigned int'} [-Wsign-compare]
   42 |     for(int i = x - 1; i < n; i--)
      |                        ~~^~~
input/code.cpp: In function 'int main()':
input/code.cpp:55:22: warning: comparison of integer expressions of different signedness: 'int' and 'uint32_t' {aka 'unsigned int'} [-Wsign-compare]
   55 |     for(int y = 0; y < n; y++)
      |...

#include <iostream>
#include <vector>

// Array to map out how many routes go out of each value and the value itself
// (paths from (mod 10^9 + 7, val)
std::vector<std::pair<uint32_t, int>> g_Map;
int g_LowestValue = 1000000000;
uint32_t n = 0;

constexpr uint32_t c_ModVal = 1000000007;

// Recursive, but worse is less than 1000 * 1000 * 2.
// Can fix by going the lowest values first and ect.
// Function will only really do calculations n * n times

uint32_t GetRouteCount(int x, int y)
{
    auto& pair = g_Map[y * n + x];

    if(pair.first != 0)
        return pair.first;

    if(pair.second == g_LowestValue)
        return 0;

    // Check DOWN
    for(int i = y + 1; i < n; i++)
        if(g_Map[i * n + x].second < pair.second)
            pair.first = (pair.first + GetRouteCount(x, i) + 1) % c_ModVal;

    // Check UP
    for(int i = y - 1; i > -1; i--)
        if(g_Map[i * n + x].second < pair.second)
            pair.first = (pair.first + GetRouteCount(x, i) + 1) % c_ModVal;

    // Check RIGHT
    for(int i = x + 1; i < n; i++)
        if(g_Map[y * n + i].second < pair.second)
            pair.first = (pair.first + GetRouteCount(i, y) + 1) % c_ModVal;

    // Check LEFT
    for(int i = x - 1; i < n; i--)
        if(g_Map[y * n + i].second < pair.second)
            pair.first = (pair.first + GetRouteCount(i, y) + 1) % c_ModVal;

    return pair.first;
}

int main()
{
    std::cin >> n;

    g_Map.resize(n * n);

    for(int y = 0; y < n; y++)
    {
        for(int x = 0; x < n; x++)
        {
            int val = 0;
            std::cin >> val;

            if(val < g_LowestValue)
                g_LowestValue = val;

            g_Map[y * n + x] = {0, val};
        }
    }

    // Get all route values
    uint32_t routeTotal = 0;

    for(int y = 0; y < n; y++)
    {
        for(int x = 0; x < n; x++)
        {
            auto& pair = g_Map[y * n + x];

            routeTotal = (routeTotal + GetRouteCount(x, y)) % c_ModVal;
        }
    }

    std::cout << (routeTotal + n * n) % c_ModVal << "\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: ACCEPTED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED