Submission #75921353

Source Code Expand

q = int(input())
A = list(map(int,input().split()))
B = [0]*q

for i in range(q):
    if A[i] < 0:
        x = -A[i]
        B[i] = A[x-1]

for i in range(q):
    if A[i] > 0 and B[A[i]-1] != 0:
        B[i] = B[A[i]-1]

for i in range(q):
    if B[i] == 0:
        B[i] = 1
print(*B)

Submission Info

Submission Time
Task F - SQL
User Cenix820
Language Python (PyPy 3.11-v7.3.20)
Score 0
Code Size 300 Byte
Status WA
Exec Time 414 ms
Memory 202928 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 1
AC × 16
WA × 14
Set Name Test Cases
Sample 00-sample-001.txt
All 00-sample-001.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt
Case Name Status Exec Time Memory
00-sample-001.txt AC 51 ms 79564 KiB
01-02.txt AC 50 ms 79508 KiB
01-03.txt AC 49 ms 79284 KiB
01-04.txt AC 50 ms 79348 KiB
01-05.txt AC 49 ms 79180 KiB
01-06.txt WA 49 ms 79272 KiB
01-07.txt WA 48 ms 79736 KiB
01-08.txt WA 49 ms 80116 KiB
01-09.txt WA 53 ms 86112 KiB
01-10.txt WA 66 ms 98656 KiB
01-11.txt WA 74 ms 108532 KiB
01-12.txt WA 103 ms 115700 KiB
01-13.txt WA 136 ms 126168 KiB
01-14.txt WA 414 ms 200032 KiB
01-15.txt AC 399 ms 202928 KiB
01-16.txt AC 376 ms 191868 KiB
01-17.txt AC 131 ms 124680 KiB
01-18.txt AC 378 ms 191948 KiB
01-19.txt AC 130 ms 123104 KiB
01-20.txt AC 128 ms 124588 KiB
01-21.txt AC 133 ms 124768 KiB
01-22.txt AC 362 ms 176348 KiB
01-23.txt AC 369 ms 192404 KiB
01-24.txt AC 380 ms 192464 KiB
01-25.txt WA 377 ms 192120 KiB
01-26.txt WA 375 ms 191892 KiB
01-27.txt WA 376 ms 192124 KiB
01-28.txt WA 383 ms 192860 KiB
01-29.txt WA 370 ms 191900 KiB
01-30.txt AC 374 ms 192332 KiB