Submission #73914707

Source Code Expand

import sys
sys.setrecursionlimit(10 ** 7)

N = int(input())
A = [int(x) - 1 for x in input().split()]
G = [[] for _ in range(N)]
for _ in range(N - 1):
    u, v = map(int, input().split())
    G[u - 1].append(v - 1)
    G[v - 1].append(u - 1)

ans = [True] * N
d = dict()

def dfs(v: int, p: int, ok: bool):
    ok_ = ok
    d[A[v]] = d.get(A[v], 0) + 1
    if d[A[v]] > 1:
        ok_ = False
    if not ok_:
        ans[v] = False

    for nv in G[v]:
        if nv == p:
            continue
        dfs(nv, v, ok_)
    
    d[A[v]] -= 1

dfs(0, -1, True)
for i in range(N):
    print("Yes" if not ans[i] else "No")

Submission Info

Submission Time
Task D - Integer-duplicated Path
User stockdock01
Language Python (PyPy 3.11-v7.3.20)
Score 400
Code Size 651 Byte
Status AC
Exec Time 1878 ms
Memory 516384 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 47
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 AC 1127 ms 244568 KiB
hack_02.txt AC 1251 ms 244684 KiB
hack_03.txt AC 723 ms 142960 KiB
hack_04.txt AC 672 ms 142980 KiB
hack_05.txt AC 1135 ms 236212 KiB
hack_06.txt AC 1116 ms 236164 KiB
sample_01.txt AC 62 ms 79696 KiB
sample_02.txt AC 62 ms 79832 KiB
sample_03.txt AC 62 ms 79664 KiB
test_01.txt AC 61 ms 79908 KiB
test_02.txt AC 60 ms 79808 KiB
test_03.txt AC 1373 ms 324752 KiB
test_04.txt AC 1442 ms 325496 KiB
test_05.txt AC 1355 ms 326196 KiB
test_06.txt AC 1411 ms 314088 KiB
test_07.txt AC 1227 ms 291584 KiB
test_08.txt AC 1202 ms 291044 KiB
test_09.txt AC 735 ms 165016 KiB
test_10.txt AC 738 ms 165228 KiB
test_11.txt AC 738 ms 164196 KiB
test_12.txt AC 733 ms 151064 KiB
test_13.txt AC 693 ms 143112 KiB
test_14.txt AC 690 ms 143112 KiB
test_15.txt AC 905 ms 155056 KiB
test_16.txt AC 853 ms 155276 KiB
test_17.txt AC 880 ms 154896 KiB
test_18.txt AC 966 ms 155056 KiB
test_19.txt AC 847 ms 136360 KiB
test_20.txt AC 863 ms 136524 KiB
test_21.txt AC 874 ms 159908 KiB
test_22.txt AC 913 ms 160136 KiB
test_23.txt AC 847 ms 161240 KiB
test_24.txt AC 863 ms 143608 KiB
test_25.txt AC 915 ms 138096 KiB
test_26.txt AC 773 ms 142136 KiB
test_27.txt AC 1255 ms 281000 KiB
test_28.txt AC 1490 ms 348600 KiB
test_29.txt AC 1878 ms 516384 KiB
test_30.txt AC 1347 ms 331300 KiB
test_31.txt AC 1337 ms 267832 KiB
test_32.txt AC 1181 ms 234304 KiB
test_33.txt AC 1529 ms 354556 KiB
test_34.txt AC 1418 ms 307024 KiB
test_35.txt AC 1481 ms 292640 KiB
test_36.txt AC 1195 ms 186420 KiB
test_37.txt AC 1427 ms 348188 KiB
test_38.txt AC 1194 ms 189576 KiB