Submission #73929933

Source Code Expand

import sys
input = sys.stdin.readline

n = int(input())
a = list(map(int, input().split()))

u = []
v = []

for _ in range(n-1):
    inp = list(map(int, input().split()))
    u.append(inp[0])
    v.append(inp[1])

kimenet = ['']*n
def solve(hanyas, eddigi):
    global kimenet
    if kimenet[hanyas-1] != '':
        return
    if list(set(eddigi + [a[hanyas-1]])) == eddigi + [a[hanyas-1]]:
        kimenet[hanyas-1] = 'No'
    else:
        kimenet[hanyas-1] = 'Yes'
    
    for i in range(n-1):
        if u[i] == hanyas:
            solve(v[i], eddigi + [a[hanyas-1]])
        if v[i] == hanyas:
            solve(u[i], eddigi + [a[hanyas-1]])

solve(1, [])
for ki in kimenet:
    print(ki)

Submission Info

Submission Time
Task D - Integer-duplicated Path
User SKristof0306
Language Python (PyPy 3.11-v7.3.20)
Score 0
Code Size 727 Byte
Status RE
Exec Time > 2000 ms
Memory 182332 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 5
TLE × 21
RE × 21
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All hack_01.txt, hack_02.txt, hack_03.txt, hack_04.txt, hack_05.txt, hack_06.txt, sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt
Case Name Status Exec Time Memory
hack_01.txt RE 485 ms 138984 KiB
hack_02.txt RE 471 ms 142588 KiB
hack_03.txt TLE > 2000 ms 139040 KiB
hack_04.txt TLE > 2000 ms 139040 KiB
hack_05.txt RE 489 ms 139016 KiB
hack_06.txt RE 486 ms 138952 KiB
sample_01.txt AC 55 ms 79700 KiB
sample_02.txt AC 55 ms 79780 KiB
sample_03.txt AC 54 ms 79796 KiB
test_01.txt AC 54 ms 79804 KiB
test_02.txt AC 56 ms 79784 KiB
test_03.txt RE 480 ms 139044 KiB
test_04.txt RE 474 ms 139040 KiB
test_05.txt RE 480 ms 139032 KiB
test_06.txt RE 473 ms 138808 KiB
test_07.txt RE 456 ms 138784 KiB
test_08.txt RE 451 ms 138420 KiB
test_09.txt TLE > 2000 ms 138960 KiB
test_10.txt TLE > 2000 ms 138956 KiB
test_11.txt TLE > 2000 ms 139052 KiB
test_12.txt TLE > 2000 ms 139116 KiB
test_13.txt TLE > 2000 ms 139108 KiB
test_14.txt TLE > 2000 ms 139000 KiB
test_15.txt TLE > 2000 ms 138936 KiB
test_16.txt TLE > 2000 ms 138804 KiB
test_17.txt TLE > 2000 ms 139044 KiB
test_18.txt TLE > 2000 ms 138980 KiB
test_19.txt TLE > 2000 ms 138960 KiB
test_20.txt TLE > 2000 ms 139016 KiB
test_21.txt TLE > 2000 ms 139120 KiB
test_22.txt TLE > 2000 ms 138928 KiB
test_23.txt TLE > 2000 ms 139104 KiB
test_24.txt TLE > 2000 ms 138960 KiB
test_25.txt TLE > 2000 ms 139136 KiB
test_26.txt TLE > 2000 ms 138936 KiB
test_27.txt RE 545 ms 139000 KiB
test_28.txt RE 1006 ms 145684 KiB
test_29.txt RE 604 ms 139452 KiB
test_30.txt RE 539 ms 138912 KiB
test_31.txt RE 727 ms 145208 KiB
test_32.txt RE 526 ms 138964 KiB
test_33.txt RE 875 ms 145536 KiB
test_34.txt RE 542 ms 141724 KiB
test_35.txt RE 1215 ms 182332 KiB
test_36.txt TLE > 2000 ms 139044 KiB
test_37.txt RE 497 ms 138836 KiB
test_38.txt RE 968 ms 138960 KiB