結果
問題 | No.1333 Squared Sum |
ユーザー | chineristAC |
提出日時 | 2021-01-08 21:44:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 685 ms / 2,000 ms |
コード長 | 1,565 bytes |
コンパイル時間 | 258 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 144,948 KB |
最終ジャッジ日時 | 2024-04-28 02:37:01 |
合計ジャッジ時間 | 20,472 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
53,632 KB |
testcase_01 | AC | 37 ms
53,760 KB |
testcase_02 | AC | 39 ms
53,760 KB |
testcase_03 | AC | 645 ms
138,176 KB |
testcase_04 | AC | 604 ms
137,628 KB |
testcase_05 | AC | 622 ms
137,100 KB |
testcase_06 | AC | 630 ms
137,608 KB |
testcase_07 | AC | 623 ms
138,368 KB |
testcase_08 | AC | 636 ms
137,036 KB |
testcase_09 | AC | 644 ms
137,120 KB |
testcase_10 | AC | 649 ms
138,088 KB |
testcase_11 | AC | 637 ms
134,980 KB |
testcase_12 | AC | 641 ms
137,732 KB |
testcase_13 | AC | 485 ms
135,012 KB |
testcase_14 | AC | 664 ms
137,828 KB |
testcase_15 | AC | 683 ms
136,560 KB |
testcase_16 | AC | 38 ms
53,888 KB |
testcase_17 | AC | 37 ms
54,144 KB |
testcase_18 | AC | 36 ms
53,888 KB |
testcase_19 | AC | 35 ms
53,888 KB |
testcase_20 | AC | 36 ms
53,760 KB |
testcase_21 | AC | 36 ms
53,760 KB |
testcase_22 | AC | 36 ms
54,016 KB |
testcase_23 | AC | 36 ms
53,888 KB |
testcase_24 | AC | 36 ms
53,888 KB |
testcase_25 | AC | 36 ms
53,760 KB |
testcase_26 | AC | 685 ms
134,540 KB |
testcase_27 | AC | 680 ms
136,428 KB |
testcase_28 | AC | 683 ms
135,628 KB |
testcase_29 | AC | 515 ms
135,164 KB |
testcase_30 | AC | 274 ms
102,656 KB |
testcase_31 | AC | 190 ms
93,312 KB |
testcase_32 | AC | 371 ms
112,472 KB |
testcase_33 | AC | 298 ms
104,920 KB |
testcase_34 | AC | 496 ms
123,640 KB |
testcase_35 | AC | 389 ms
113,536 KB |
testcase_36 | AC | 241 ms
102,716 KB |
testcase_37 | AC | 255 ms
101,196 KB |
testcase_38 | AC | 292 ms
103,680 KB |
testcase_39 | AC | 425 ms
120,336 KB |
testcase_40 | AC | 422 ms
144,948 KB |
testcase_41 | AC | 408 ms
140,940 KB |
testcase_42 | AC | 409 ms
143,792 KB |
testcase_43 | AC | 397 ms
140,980 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)