結果

問題 No.1103 Directed Length Sum
ユーザー toyuzuko
提出日時 2020-07-07 15:49:15
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,299 ms / 3,000 ms
コード長 901 bytes
コンパイル時間 341 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 346,040 KB
最終ジャッジ日時 2024-10-01 08:36:39
合計ジャッジ時間 18,661 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
input = sys.stdin.buffer.readline
MOD = 1000000007
N = int(input())
edge = [tuple(map(int, input().split())) for _ in range(N - 1)]
tree = [[] for _ in range(N)]
par = [None for _ in range(N)]
dep = [None for _ in range(N)]
cum = [None for _ in range(N)]
for e in edge:
tree[e[0] - 1].append(e[1] - 1)
par[e[1] - 1] = e[0] - 1
for i in range(N):
if par[i] is None:
root = i
stack = [root]
dep[root] = 0
while stack:
node = stack.pop()
for adj in tree[node]:
if dep[adj] is not None:
continue
dep[adj] = dep[node] + 1
dep[adj] %= MOD
stack.append(adj)
stack = [root]
cum[root] = 0
while stack:
node = stack.pop()
for adj in tree[node]:
if cum[adj] is not None:
continue
cum[adj] = cum[node] + dep[adj]
cum[adj] %= MOD
stack.append(adj)
print(sum(cum) % MOD)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0