結果
問題 | No.1928 Make a Binary Tree |
ユーザー |
![]() |
提出日時 | 2022-05-06 22:25:54 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 738 ms / 3,000 ms |
コード長 | 1,498 bytes |
コンパイル時間 | 184 ms |
コンパイル使用メモリ | 82,156 KB |
実行使用メモリ | 150,712 KB |
最終ジャッジ日時 | 2024-07-05 23:45:21 |
合計ジャッジ時間 | 21,902 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 57 |
ソースコード
mod = 998244353 def main(): import sys from collections import deque from heapq import heappush, heappop input = sys.stdin.buffer.readline N = int(input()) adj = [[] for _ in range(N+1)] for _ in range(N-1): a, b = map(int, input().split()) adj[a].append(b) adj[b].append(a) que = deque() que.append(1) seen = [-1] * (N+1) seen[1] = 0 par = [0] * (N+1) child = [[] for _ in range(N+1)] seq = [] while que: v = que.popleft() seq.append(v) for u in adj[v]: if seen[u] == -1: seen[u] = seen[v] + 1 par[u] = v child[v].append(u) que.append(u) seq.reverse() size = [1] * (N + 1) for v in seq: for u in child[v]: size[v] += size[u] pq_list = [[] for _ in range(N+1)] for v in seq: if not child[v]: continue for u in child[v]: heappush(pq_list[v], (-size[u], u)) # merge for u in child[v]: if len(pq_list[v]) < len(pq_list[u]): pq_list[v], pq_list[u] = pq_list[u], pq_list[v] for s, w in pq_list[u]: heappush(pq_list[v], (s, w)) s1, u1 = heappop(pq_list[v]) size[v] = 1-s1 if pq_list[v]: s2, u2 = heappop(pq_list[v]) size[v] += -s2 print(size[1]) assert size[1] <= N if __name__ == '__main__': main()