結果
問題 | No.1103 Directed Length Sum |
ユーザー | McGregorsh |
提出日時 | 2022-07-10 13:55:54 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,675 ms / 3,000 ms |
コード長 | 2,021 bytes |
コンパイル時間 | 465 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 232,220 KB |
最終ジャッジ日時 | 2024-06-10 23:55:19 |
合計ジャッジ時間 | 18,716 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 131 ms
89,424 KB |
testcase_01 | AC | 132 ms
89,152 KB |
testcase_02 | AC | 915 ms
222,552 KB |
testcase_03 | AC | 838 ms
232,220 KB |
testcase_04 | AC | 968 ms
148,444 KB |
testcase_05 | AC | 1,675 ms
189,656 KB |
testcase_06 | AC | 659 ms
126,020 KB |
testcase_07 | AC | 256 ms
98,244 KB |
testcase_08 | AC | 310 ms
103,464 KB |
testcase_09 | AC | 213 ms
95,360 KB |
testcase_10 | AC | 386 ms
108,160 KB |
testcase_11 | AC | 1,034 ms
152,632 KB |
testcase_12 | AC | 617 ms
127,160 KB |
testcase_13 | AC | 392 ms
108,880 KB |
testcase_14 | AC | 206 ms
93,936 KB |
testcase_15 | AC | 527 ms
118,988 KB |
testcase_16 | AC | 1,173 ms
161,284 KB |
testcase_17 | AC | 1,242 ms
164,244 KB |
testcase_18 | AC | 371 ms
108,032 KB |
testcase_19 | AC | 1,073 ms
155,124 KB |
testcase_20 | AC | 222 ms
96,128 KB |
testcase_21 | AC | 277 ms
101,692 KB |
testcase_22 | AC | 894 ms
142,840 KB |
testcase_23 | AC | 564 ms
121,216 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 count = 0 ###関数コピーしたか?### def main(): n = int(input()) nums = [[] for i in range(n)] hen = [0] * n for i in range(n-1): a, b = i_map() a -= 1 b -= 1 nums[a].append(b) hen[b] += 1 for i in range(n): if hen[i] == 0: root = i break score = [INF] * n score[root] = 0 que = deque() que.append(root) while que: num = que.popleft() for i in nums[num]: if score[i] == INF: score[i] = score[num] + 1 que.append(i) ans = 0 for i in range(n): point = score[i] ans += point * (point+1) // 2 ans %= MOD print(ans) if __name__ == '__main__': main()