結果
問題 | No.1103 Directed Length Sum |
ユーザー | tonnnura172 |
提出日時 | 2020-07-11 05:02:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,102 ms / 3,000 ms |
コード長 | 1,538 bytes |
コンパイル時間 | 260 ms |
コンパイル使用メモリ | 82,288 KB |
実行使用メモリ | 275,508 KB |
最終ジャッジ日時 | 2024-10-12 06:36:14 |
合計ジャッジ時間 | 20,916 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 60 ms
66,512 KB |
testcase_01 | AC | 60 ms
66,412 KB |
testcase_02 | AC | 687 ms
264,032 KB |
testcase_03 | AC | 586 ms
275,508 KB |
testcase_04 | AC | 1,152 ms
166,324 KB |
testcase_05 | AC | 2,102 ms
243,960 KB |
testcase_06 | AC | 750 ms
136,924 KB |
testcase_07 | AC | 222 ms
94,376 KB |
testcase_08 | AC | 314 ms
102,924 KB |
testcase_09 | AC | 168 ms
87,408 KB |
testcase_10 | AC | 432 ms
112,668 KB |
testcase_11 | AC | 1,250 ms
186,180 KB |
testcase_12 | AC | 778 ms
137,576 KB |
testcase_13 | AC | 421 ms
114,548 KB |
testcase_14 | AC | 151 ms
85,628 KB |
testcase_15 | AC | 631 ms
128,404 KB |
testcase_16 | AC | 1,487 ms
192,368 KB |
testcase_17 | AC | 1,576 ms
194,836 KB |
testcase_18 | AC | 417 ms
111,948 KB |
testcase_19 | AC | 1,320 ms
196,148 KB |
testcase_20 | AC | 178 ms
89,556 KB |
testcase_21 | AC | 284 ms
97,896 KB |
testcase_22 | AC | 1,061 ms
173,340 KB |
testcase_23 | AC | 646 ms
137,080 KB |
ソースコード
import sys, re from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd, log2 from itertools import accumulate, permutations, combinations, product from operator import itemgetter, mul, add from copy import deepcopy from string import ascii_lowercase, ascii_uppercase, digits from bisect import bisect, bisect_left from heapq import heappush, heappop from functools import reduce, lru_cache def input(): return sys.stdin.readline().strip() def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(): return list(map(int, input().split())) def ZIP(n): return zip(*(MAP() for _ in range(n))) sys.setrecursionlimit(10 ** 9) INF = float('inf') mod = 10 ** 9 + 7 N = INT() tree = [[] for _ in range(N)] din = [0]*N for _ in range(N-1): A, B = MAP() tree[A-1].append(B-1) din[B-1] += 1 root = din.index(0) size_d = [0]*N size_u = [0]*N parent = [0]*N order = [] stack = [root] while stack: x = stack.pop() size_u[x] += 1 order.append(x) for y in tree[x]: size_u[y] += size_u[x] parent[y] = x stack.append(y) for v in order[::-1]: # 根に遠いほうから(down方向のボトムアップ) size_d[v] += 1 if v == root: break p = parent[v] s = size_d[v] size_d[p] += s # print(size_u, size_d) q = deque([root]) ans = 0 while q: n = q.popleft() for node in tree[n]: ans += size_u[n]*size_d[node] ans %= mod q.append(node) print(ans)