結果
問題 | No.1333 Squared Sum |
ユーザー | chineristAC |
提出日時 | 2021-01-08 21:44:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 871 ms / 2,000 ms |
コード長 | 1,565 bytes |
コンパイル時間 | 1,037 ms |
コンパイル使用メモリ | 86,760 KB |
実行使用メモリ | 151,856 KB |
最終ジャッジ日時 | 2023-08-10 09:11:11 |
合計ジャッジ時間 | 27,248 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 89 ms
71,364 KB |
testcase_01 | AC | 90 ms
71,348 KB |
testcase_02 | AC | 90 ms
71,520 KB |
testcase_03 | AC | 863 ms
136,700 KB |
testcase_04 | AC | 745 ms
136,332 KB |
testcase_05 | AC | 760 ms
136,036 KB |
testcase_06 | AC | 753 ms
136,120 KB |
testcase_07 | AC | 746 ms
136,552 KB |
testcase_08 | AC | 751 ms
136,036 KB |
testcase_09 | AC | 770 ms
135,980 KB |
testcase_10 | AC | 729 ms
135,764 KB |
testcase_11 | AC | 822 ms
134,272 KB |
testcase_12 | AC | 777 ms
135,980 KB |
testcase_13 | AC | 582 ms
136,420 KB |
testcase_14 | AC | 831 ms
136,892 KB |
testcase_15 | AC | 789 ms
135,864 KB |
testcase_16 | AC | 88 ms
71,600 KB |
testcase_17 | AC | 86 ms
71,552 KB |
testcase_18 | AC | 85 ms
71,540 KB |
testcase_19 | AC | 85 ms
71,540 KB |
testcase_20 | AC | 90 ms
71,548 KB |
testcase_21 | AC | 92 ms
71,496 KB |
testcase_22 | AC | 89 ms
71,660 KB |
testcase_23 | AC | 90 ms
71,324 KB |
testcase_24 | AC | 91 ms
71,332 KB |
testcase_25 | AC | 85 ms
71,496 KB |
testcase_26 | AC | 844 ms
136,208 KB |
testcase_27 | AC | 826 ms
136,756 KB |
testcase_28 | AC | 871 ms
136,608 KB |
testcase_29 | AC | 607 ms
136,540 KB |
testcase_30 | AC | 373 ms
104,892 KB |
testcase_31 | AC | 262 ms
93,892 KB |
testcase_32 | AC | 460 ms
114,320 KB |
testcase_33 | AC | 376 ms
106,672 KB |
testcase_34 | AC | 644 ms
126,804 KB |
testcase_35 | AC | 486 ms
116,348 KB |
testcase_36 | AC | 323 ms
99,736 KB |
testcase_37 | AC | 345 ms
101,260 KB |
testcase_38 | AC | 379 ms
105,704 KB |
testcase_39 | AC | 556 ms
119,460 KB |
testcase_40 | AC | 548 ms
151,216 KB |
testcase_41 | AC | 637 ms
151,856 KB |
testcase_42 | AC | 578 ms
151,276 KB |
testcase_43 | AC | 520 ms
150,800 KB |
ソースコード
import sys from collections import deque mod = 10**9+7 input = sys.stdin.readline N = int(input()) edge = [[] for i in range(N)] for i in range(N-1): u,v,w = map(int,input().split()) edge[u-1].append((v-1,w)) edge[v-1].append((u-1,w)) deq = deque([0]) parent = [-1]*N parent[0] = (0,0) res = [] while deq: v = deq.popleft() res.append(v) for nv,w in edge[v]: if parent[nv]==-1: parent[nv] = (v,w) deq.append(nv) res = res[::-1] size = [1 for v in range(N)] dist_sum = [0 for v in range(N)] dist_sum_square = [0 for v in range(N)] for v in res: for nv,w in edge[v]: if nv!=parent[v][0]: size[v] += size[nv] dist_sum[v] += dist_sum[nv] + w * size[nv] dist_sum[v] %= mod dist_sum_square[v] += dist_sum_square[nv] + 2 * w * dist_sum[nv] + size[nv] * w * w dist_sum_square[v] %= mod #4 9 1 3 ans = [0 for v in range(N)] ans[0] = dist_sum_square[0] dist_sum_ans = [0 for v in range(N)] dist_sum_ans[0] = dist_sum[0] res = res[::-1] for v in res: if v==0: continue pv,w = parent[v] tmp = ans[pv] - ( dist_sum_square[v] + 2 * w * dist_sum[v] + size[v] * w * w ) tmp_dist_sum = dist_sum_ans[pv] - (w * size[v] + dist_sum[v]) ans[v] = dist_sum_square[v] + tmp + 2 * w * (tmp_dist_sum) + (N - size[v]) * w * w dist_sum_ans[v] = dist_sum[v] + w * (N - size[v]) + tmp_dist_sum ans[v] %= mod dist_sum_ans[v] %= mod S = 0 for v in range(N): S += ans[v] S %= mod S *= pow(2,mod-2,mod) print(S%mod)