提出 #5765780

ソースコード 拡げる

import sys
sys.setrecursionlimit(100000000)

N = int(input())
S = input()

ps = 0
v_to = [[] for i in range(N)]

for i in range(N - 1):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    v_to[a].append(b)
    v_to[b].append(a)

def dfs(id, fr, di):
    global ps
    if S[id] == '1':
        ps += di
    for t in v_to[id]:
        if t != fr:
            dfs(t, id, di + 1)

cnt = 0
for i in range(N):
    if S[i] == '1':
        cnt += 1
        dfs(i, i, 0)

print(ps)
if ps % (2 * cnt) != 0:
    print(-1)
else:
    print(ps // (2 * cnt))

提出情報

提出日時
問題 E - Complete Compress
ユーザ shirodoni
言語 PyPy3 (2.4.0)
得点 0
コード長 588 Byte
結果 WA
実行時間 2829 ms
メモリ 187140 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 0 / 1500
結果
WA × 3
WA × 43
セット名 テストケース
Sample example_00, example_01, example_02
All example_00, example_01, example_02, houki_00, houki_01, houki_02, houki_03, houki_04, houki_05, houki_06, houki_07, houki_08, houki_09, line_00, line_01, line_02, line_03, line_04, line_05, line_06, line_07, line_08, line_09, rand_00, rand_01, rand_02, rand_03, rand_04, rand_05, rand_06, rand_07, rand_08, rand_09, uni_00, uni_01, uni_02, uni_03, uni_04, uni_05, uni_06, uni_07, uni_08, uni_09
ケース名 結果 実行時間 メモリ
example_00 WA 179 ms 38256 KiB
example_01 WA 181 ms 38256 KiB
example_02 WA 180 ms 38256 KiB
houki_00 WA 1277 ms 124760 KiB
houki_01 WA 1065 ms 71896 KiB
houki_02 WA 1046 ms 76760 KiB
houki_03 WA 1606 ms 125528 KiB
houki_04 WA 1015 ms 114904 KiB
houki_05 WA 1159 ms 94432 KiB
houki_06 WA 928 ms 108632 KiB
houki_07 WA 1618 ms 125272 KiB
houki_08 WA 1208 ms 123352 KiB
houki_09 WA 1243 ms 104536 KiB
line_00 WA 2240 ms 157956 KiB
line_01 WA 2476 ms 163844 KiB
line_02 WA 1764 ms 134660 KiB
line_03 WA 2541 ms 187140 KiB
line_04 WA 1172 ms 123996 KiB
line_05 WA 2764 ms 186756 KiB
line_06 WA 1887 ms 156676 KiB
line_07 WA 2425 ms 166276 KiB
line_08 WA 1390 ms 134404 KiB
line_09 WA 2829 ms 182532 KiB
rand_00 WA 402 ms 56028 KiB
rand_01 WA 1190 ms 87256 KiB
rand_02 WA 568 ms 70748 KiB
rand_03 WA 1214 ms 92504 KiB
rand_04 WA 1164 ms 92660 KiB
rand_05 WA 1414 ms 102872 KiB
rand_06 WA 1247 ms 104024 KiB
rand_07 WA 1174 ms 92632 KiB
rand_08 WA 401 ms 57820 KiB
rand_09 WA 1132 ms 90584 KiB
uni_00 WA 498 ms 47960 KiB
uni_01 WA 600 ms 47448 KiB
uni_02 WA 512 ms 50392 KiB
uni_03 WA 642 ms 49240 KiB
uni_04 WA 513 ms 49240 KiB
uni_05 WA 619 ms 48088 KiB
uni_06 WA 561 ms 49624 KiB
uni_07 WA 630 ms 49240 KiB
uni_08 WA 455 ms 46296 KiB
uni_09 WA 556 ms 49112 KiB