Submission #1972295


Source Code Expand

g = [[] for _ in range(int(input()))]
for gv in g:
    gv.append(int(input()) - 1)

q = [[0]]
while q:
    path = q.pop(0)
    n = path[-1]
    if n == 1:
        print(len(path) - 1)
        exit()
    else:
        for x in g[n]:
            if x not in path:
                new_path = path[:]
                new_path.append(x)
                q.append(new_path)
print(-1)

Submission Info

Submission Time
Task B - Trained?
User eiji0313
Language Python (3.4.3)
Score 0
Code Size 393 Byte
Status TLE
Exec Time 2105 ms
Memory 18372 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 3
AC × 13
TLE × 12
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 220 ms 17944 KB
02.txt AC 206 ms 17968 KB
03.txt AC 204 ms 17968 KB
04.txt TLE 2105 ms 18268 KB
05.txt TLE 2104 ms 18276 KB
06.txt TLE 2105 ms 18272 KB
07.txt TLE 2105 ms 18272 KB
08.txt TLE 2105 ms 18272 KB
09.txt TLE 2105 ms 18276 KB
10.txt TLE 2105 ms 18276 KB
11.txt TLE 2104 ms 18268 KB
12.txt AC 361 ms 17968 KB
13.txt TLE 2105 ms 18272 KB
14.txt TLE 2105 ms 18268 KB
15.txt AC 211 ms 17944 KB
16.txt TLE 2104 ms 18372 KB
17.txt AC 217 ms 17968 KB
18.txt TLE 2104 ms 18344 KB
19.txt AC 17 ms 3060 KB
20.txt AC 17 ms 2940 KB
21.txt AC 17 ms 3060 KB
22.txt AC 17 ms 3064 KB
s1.txt AC 17 ms 3064 KB
s2.txt AC 17 ms 3060 KB
s3.txt AC 17 ms 2940 KB