| Task: | Ruudukko |
| Sender: | Niilo |
| Submission time: | 2022-11-12 11:59:57 +0200 |
| Language: | Python3 (CPython3) |
| Status: | READY |
| Result: | 61 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 28 |
| #2 | ACCEPTED | 33 |
| #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.16 s | 2, 3 | details |
| #5 | ACCEPTED | 0.76 s | 2, 3 | details |
| #6 | ACCEPTED | 0.39 s | 2, 3 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #8 | RUNTIME ERROR | 0.70 s | 3 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
from functools import cache
# clean version
def Ruudukko():
global R1, R2
# käsittelee syötteen
koko = int(input())
kokorange = range(koko)
ruudukko1 = [[int(s) for s in input().split(" ")] for _ in kokorange]
ruudukko2 = [[rivi[n] for rivi in ruudukko1] for n in kokorange]
R1 = ruudukko1
R2 = ruudukko2
# käy läpi kaikki vaihtoehdot rekursiivisesti
polut = 0
for c1 in kokorange:
for c2 in kokorange:
polut += rekursiivinen_reitti(c1, c2)
# yhden pituiset reitit
polut += koko * koko
# palauttaa syötteen
return polut % (10**9 + 7)
@cache
def rekursiivinen_reitti(c1: int, c2: int) -> int:
polut = 0
num = R1[c1][c2]
# kaikki vaihtoehdot vaakarivillä
i = 0
for n in R1[c1]:
# löytyi reitti riviltä
if n < num:
polut += rekursiivinen_reitti(c1, i) + 1
i += 1
# sama pystyrivillä
i = 0
for n in R2[c2]:
if n < num:
polut += rekursiivinen_reitti(i, c2) + 1
i += 1
# palauttaa polut
return polut
print(Ruudukko())
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: ACCEPTED
| input |
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 187458477 |
| user output |
|---|
| 187458477 |
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: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1000000 |
| user output |
|---|
| (empty) |
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 43, in <module>
p...Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 520283 805991 492643 75254 527... |
| correct output |
|---|
| 951147313 |
| user output |
|---|
| (empty) |
