結果
問題 | No.872 All Tree Path |
ユーザー | McGregorsh |
提出日時 | 2023-05-17 12:26:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 896 ms / 3,000 ms |
コード長 | 1,905 bytes |
コンパイル時間 | 1,011 ms |
コンパイル使用メモリ | 87,264 KB |
実行使用メモリ | 325,996 KB |
最終ジャッジ日時 | 2023-08-21 17:39:36 |
合計ジャッジ時間 | 13,147 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 761 ms
145,636 KB |
testcase_01 | AC | 739 ms
145,592 KB |
testcase_02 | AC | 896 ms
146,208 KB |
testcase_03 | AC | 787 ms
325,996 KB |
testcase_04 | AC | 261 ms
92,468 KB |
testcase_05 | AC | 783 ms
145,732 KB |
testcase_06 | AC | 800 ms
147,280 KB |
testcase_07 | AC | 790 ms
145,740 KB |
testcase_08 | AC | 333 ms
99,972 KB |
testcase_09 | AC | 334 ms
100,184 KB |
testcase_10 | AC | 326 ms
99,576 KB |
testcase_11 | AC | 332 ms
100,012 KB |
testcase_12 | AC | 331 ms
100,428 KB |
testcase_13 | AC | 243 ms
92,500 KB |
testcase_14 | AC | 243 ms
92,660 KB |
testcase_15 | AC | 243 ms
92,360 KB |
testcase_16 | AC | 244 ms
92,432 KB |
testcase_17 | AC | 244 ms
92,556 KB |
testcase_18 | AC | 244 ms
92,500 KB |
testcase_19 | AC | 246 ms
92,380 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, ROUND_HALF_UP 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 def main(): def dfs(s, p): ret = 1 for i in G[s]: if i == p: continue ret += dfs(i, s) P[s] = ret return ret N = int(input()) G = [[] for i in range(N)] cost = [] for i in range(N-1): u, v, w = i_map() u -= 1 v -= 1 cost.append([u, v, w]) G[u].append(v) G[v].append(u) P = [0] * N dfs(0, -1) ans = 0 for i in range(N-1): u, v, w = cost[i] p = min(P[u], P[v]) amari = N - p ans += p * amari * w print(ans * 2) if __name__ == '__main__': main()