| Task: | Ruudukko |
| Sender: | Savuisaa |
| Submission time: | 2022-11-06 19:41:30 +0200 |
| Language: | Python3 (CPython3) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #2 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #3 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #4 | WRONG ANSWER | 0.02 s | 2, 3 | details |
| #5 | WRONG ANSWER | 0.02 s | 2, 3 | details |
| #6 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #7 | WRONG ANSWER | 0.16 s | 3 | details |
| #8 | WRONG ANSWER | 0.22 s | 3 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
paths = 0
grid = []
n = int(input())
for i in range(n):
grid.append(list(map(int, input().split(" "))))
def findPaths(y, x):
global paths
smaller_positions = []
current_value = grid[y][x]
for i in range(n):
if (grid[y][i] < current_value):
smaller_positions.append([y, i])
for i in range(n):
if (grid[i][x] < current_value):
smaller_positions.append([i, x])
paths += len(smaller_positions)
for position in smaller_positions:
findPaths(position[0], position[1])
findPaths(0, 2)
'''
for i in range(n):
for l in range(n):
findPaths(i, l)
'''
print(paths)
Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 9 |
| user output |
|---|
| 0 |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 1 2 3 6 5 4 7 8 9 |
| correct output |
|---|
| 135 |
| user output |
|---|
| 3 |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 7 8 1 4 5 4 3 9 6 |
| correct output |
|---|
| 57 |
| user output |
|---|
| 0 |
Test 4
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 10000 |
| user output |
|---|
| 0 |
Test 5
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 187458477 |
| user output |
|---|
| 3 |
Test 6
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 2995 8734 1018 2513 7971 5063 ... |
| correct output |
|---|
| 964692694 |
| user output |
|---|
| (empty) |
Test 7
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1000000 |
| user output |
|---|
| 0 |
Test 8
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 229147081 |
| user output |
|---|
| 3 |
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 520283 805991 492643 75254 527... |
| correct output |
|---|
| 951147313 |
| user output |
|---|
| (empty) |