結果
問題 | No.439 チワワのなる木 |
ユーザー | maspy |
提出日時 | 2020-03-07 03:13:46 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 641 ms / 5,000 ms |
コード長 | 1,730 bytes |
コンパイル時間 | 138 ms |
コンパイル使用メモリ | 11,020 KB |
実行使用メモリ | 46,372 KB |
最終ジャッジ日時 | 2023-08-04 14:08:30 |
合計ジャッジ時間 | 6,215 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 15 ms
8,228 KB |
testcase_01 | AC | 15 ms
8,048 KB |
testcase_02 | AC | 17 ms
8,080 KB |
testcase_03 | AC | 16 ms
8,164 KB |
testcase_04 | AC | 16 ms
8,064 KB |
testcase_05 | AC | 16 ms
8,056 KB |
testcase_06 | AC | 17 ms
8,072 KB |
testcase_07 | AC | 17 ms
7,988 KB |
testcase_08 | AC | 16 ms
8,112 KB |
testcase_09 | AC | 17 ms
8,112 KB |
testcase_10 | AC | 17 ms
8,120 KB |
testcase_11 | AC | 17 ms
8,152 KB |
testcase_12 | AC | 18 ms
8,120 KB |
testcase_13 | AC | 18 ms
8,112 KB |
testcase_14 | AC | 18 ms
8,108 KB |
testcase_15 | AC | 21 ms
8,696 KB |
testcase_16 | AC | 23 ms
8,948 KB |
testcase_17 | AC | 21 ms
8,696 KB |
testcase_18 | AC | 416 ms
31,208 KB |
testcase_19 | AC | 369 ms
29,896 KB |
testcase_20 | AC | 533 ms
37,996 KB |
testcase_21 | AC | 155 ms
18,368 KB |
testcase_22 | AC | 124 ms
16,588 KB |
testcase_23 | AC | 641 ms
40,588 KB |
testcase_24 | AC | 552 ms
36,272 KB |
testcase_25 | AC | 551 ms
39,936 KB |
testcase_26 | AC | 521 ms
39,028 KB |
testcase_27 | AC | 405 ms
46,372 KB |
ソースコード
#!/usr/bin/env python3 # %% import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines # %% N = int(readline()) S = ' ' + readline().decode().rstrip() m = map(int, read().split()) AB = zip(m, m) # %% graph = [[] for _ in range(N + 1)] for a, b in AB: graph[a].append(b) graph[b].append(a) # %% root = 1 parent = [0] * (N + 1) order = [] stack = [root] while stack: x = stack.pop() order.append(x) for y in graph[x]: if y == parent[x]: continue parent[y] = x stack.append(y) # %% dp1_w = [0] * (N + 1) dp1_ww = [0] * (N + 1) for v in order[::-1]: p = parent[v] dp1_w[p] += dp1_w[v] dp1_ww[p] += dp1_ww[v] if S[v] == 'w': dp1_w[p] += 1 dp1_ww[p] += dp1_w[v] dp1_w, dp1_ww # %% dp2_w = [0] * (N + 1) dp2_ww = [0] * (N + 1) for v in order[1:]: p = parent[v] if S[p] == 'w' and S[v] == 'w': dp2_w[v] = dp2_w[p] + dp1_w[p] - (1 + dp1_w[v]) + 1 dp2_ww[v] = (dp2_ww[p] + dp2_w[p]) + (dp1_ww[p] + dp1_w[p]) - (dp1_ww[v] + 2 * dp1_w[v] + 1) elif S[p] == 'w' and S[v] == 'c': dp2_w[v] = dp2_w[p] + dp1_w[p] - (dp1_w[v]) + 1 dp2_ww[v] = (dp2_ww[p] + dp2_w[p]) + (dp1_ww[p] + dp1_w[p]) - dp1_w[v] - dp1_ww[v] elif S[p] == 'c' and S[v] == 'w': dp2_w[v] = dp2_w[p] + dp1_w[p] - (1 + dp1_w[v]) dp2_ww[v] = dp2_ww[p] + dp1_ww[p] - (dp1_ww[v] + dp1_w[v]) elif S[p] == 'c' and S[v] == 'c': dp2_w[v] = dp2_w[p] + dp1_w[p] - dp1_w[v] dp2_ww[v] = dp2_ww[p] + dp1_ww[p] - dp1_ww[v] dp2_w, dp2_ww # %% ww = [x + y for x, y in zip(dp1_ww, dp2_ww)] answer = sum(x * (ch == 'c') for x, ch in zip(ww, S)) print(answer)