Submission #5708264

Source Code Expand

def dfs(node, distance, ans, G):
    for next_node, edge_size in G[node]:
        if ans[next_node] == -1:
            ans[next_node] = ((distance+edge_size) % 2)
            dfs(next_node, distance+edge_size, ans, G)
    return ans


N = int(input())

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

ans = [-1]*N
ans = dfs(0, 0, ans, G)
print(*ans, sep='\n')

Submission Info

Submission Time
Task D - Even Relation
User upura
Language Python (3.4.3)
Score 0
Code Size 476 Byte
Status RE
Exec Time 827 ms
Memory 46768 KiB

Judge Result

Set Name All Sample
Score / Max Score 0 / 400 0 / 0
Status
AC × 19
RE × 3
AC × 2
Set Name Test Cases
All sample_01, sample_02, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16, testcase_17, testcase_18, testcase_19, testcase_20
Sample sample_01, sample_02
Case Name Status Exec Time Memory
sample_01 AC 17 ms 3064 KiB
sample_02 AC 17 ms 3064 KiB
testcase_01 AC 441 ms 31976 KiB
testcase_02 AC 254 ms 21764 KiB
testcase_03 AC 330 ms 25844 KiB
testcase_04 RE 377 ms 28160 KiB
testcase_05 RE 691 ms 42052 KiB
testcase_06 RE 268 ms 19992 KiB
testcase_07 AC 17 ms 3064 KiB
testcase_08 AC 17 ms 3064 KiB
testcase_09 AC 17 ms 3064 KiB
testcase_10 AC 175 ms 14876 KiB
testcase_11 AC 28 ms 4080 KiB
testcase_12 AC 258 ms 20464 KiB
testcase_13 AC 263 ms 20924 KiB
testcase_14 AC 260 ms 21248 KiB
testcase_15 AC 824 ms 46768 KiB
testcase_16 AC 827 ms 46768 KiB
testcase_17 AC 762 ms 44884 KiB
testcase_18 AC 118 ms 11100 KiB
testcase_19 AC 526 ms 33432 KiB
testcase_20 AC 165 ms 14672 KiB