結果

問題 No.1418 Sum of Sum of Subtree Size
ユーザー chineristACchineristAC
提出日時 2021-03-05 22:18:33
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 309 ms / 2,000 ms
コード長 1,630 bytes
コンパイル時間 372 ms
コンパイル使用メモリ 82,320 KB
実行使用メモリ 100,200 KB
最終ジャッジ日時 2024-10-07 02:34:31
合計ジャッジ時間 8,066 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

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

def cmb(n, r, mod):# 
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return (g1[n] * g2[r] % mod) * g2[n-r] % mod
mod = 998244353#
N = 2*10**3
g1 = [1]*(N+1) #
g2 = [1]*(N+1) #
inverse = [1]*(N+1) #
for i in range( 2, N + 1 ):
g1[i]=( ( g1[i-1] * i ) % mod )
inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
N = int(input())
edge = [[] for i in range(N)]
for _ in range(N-1):
a,b = mi()
edge[a-1].append(b-1)
edge[b-1].append(a-1)
depth = [0 for i in range(N)]
parent = [-1 for i in range(N)]
deq = deque([0])
res = []
while deq:
v = deq.popleft()
res.append(v)
for nv in edge[v]:
if nv!=parent[v]:
parent[nv] = v
depth[nv] = depth[v] + 1
deq.append(nv)
res = res[::-1]
size = [1 for i in range(N)]
d_sum = [1 for i in range(N)]
for v in res:
for nv in edge[v]:
if nv==parent[v]:
continue
size[v] += size[nv]
d_sum[v] += size[nv] + d_sum[nv]
ans = 0
for v in res[::-1]:
ans += d_sum[v]
for nv in edge[v]:
if nv==parent[v]:
continue
d_sum[nv] = d_sum[v] + N - 2 * size[nv]
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0