| Task: | Ruudukko | 
| Sender: | DualRed | 
| Submission time: | 2022-10-31 19:09:05 +0200 | 
| Language: | Python3 (CPython3) | 
| Status: | READY | 
| Result: | 28 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 28 | 
| #2 | TIME LIMIT EXCEEDED | 0 | 
| #3 | TIME LIMIT EXCEEDED | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | 1, 2, 3 | details | 
| #2 | ACCEPTED | 0.02 s | 1, 2, 3 | details | 
| #3 | ACCEPTED | 0.02 s | 1, 2, 3 | details | 
| #4 | ACCEPTED | 0.03 s | 2, 3 | details | 
| #5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #6 | ACCEPTED | 0.99 s | 2, 3 | details | 
| #7 | ACCEPTED | 0.72 s | 3 | details | 
| #8 | RUNTIME ERROR | 0.60 s | 3 | details | 
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details | 
Code
def RoutesFromPoint(x, y, memo):
    if grid[x][y] == 1:
        return 1
    s = str(x) + "-" + str(y)
    if s in memo:
        return memo[s]
    totalCount = 1
    for x2 in range(gridSize):
        if x2 != x and grid[x2][y] < grid[x][y]:
            totalCount += RoutesFromPoint(x2, y, memo)
    for y2 in range(gridSize):
        if y2 != y and grid[x][y2] < grid[x][y]:
            totalCount += RoutesFromPoint(x, y2, memo)
    memo[str(x) + "-" + str(y)] = totalCount
    return totalCount
gridSize = int(input())
grid = [[0 for n in range(gridSize)] for m in range(gridSize)]
for y in range(gridSize):
    row = input().split(" ")
    for x in range(gridSize):
        grid[x][y] = int(row[x])
totalCount = 0
memo = {}
for x in range(gridSize):
    for y in range(gridSize):
        totalCount += RoutesFromPoint(x, y, memo)
print(totalCount % (1000000007))
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 1 1 1 1 1 1 1 1 1  | 
| correct output | 
|---|
| 9 | 
| user output | 
|---|
| 9 | 
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 1 2 3 6 5 4 7 8 9  | 
| correct output | 
|---|
| 135 | 
| user output | 
|---|
| 135 | 
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 7 8 1 4 5 4 3 9 6  | 
| correct output | 
|---|
| 57 | 
| user output | 
|---|
| 57 | 
Test 4
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...  | 
| correct output | 
|---|
| 10000 | 
| user output | 
|---|
| 10000 | 
Test 5
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 187458477 | 
| user output | 
|---|
| (empty) | 
Test 6
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 100 2995 8734 1018 2513 7971 5063 ...  | 
| correct output | 
|---|
| 964692694 | 
| user output | 
|---|
| 964692694 | 
Test 7
Group: 3
Verdict: ACCEPTED
| input | 
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...  | 
| correct output | 
|---|
| 1000000 | 
| user output | 
|---|
| 1000000 | 
Test 8
Group: 3
Verdict: RUNTIME ERROR
| input | 
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 229147081 | 
| user output | 
|---|
| (empty) | 
Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 31, in <module>
    t...Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 520283 805991 492643 75254 527...  | 
| correct output | 
|---|
| 951147313 | 
| user output | 
|---|
| (empty) | 
