結果

問題 No.1334 Multiply or Add
ユーザー toyuzukotoyuzuko
提出日時 2021-04-18 00:17:12
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 2,431 bytes
コンパイル時間 289 ms
コンパイル使用メモリ 87,104 KB
実行使用メモリ 105,880 KB
最終ジャッジ日時 2023-09-17 07:26:57
合計ジャッジ時間 17,197 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
testcase_45 RE -
testcase_46 RE -
testcase_47 RE -
testcase_48 RE -
testcase_49 RE -
testcase_50 RE -
testcase_51 RE -
testcase_52 RE -
testcase_53 RE -
testcase_54 RE -
testcase_55 RE -
testcase_56 RE -
testcase_57 RE -
testcase_58 RE -
testcase_59 RE -
testcase_60 RE -
testcase_61 RE -
testcase_62 RE -
testcase_63 RE -
testcase_64 RE -
testcase_65 RE -
testcase_66 RE -
testcase_67 RE -
testcase_68 RE -
testcase_69 RE -
testcase_70 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

class Tree():
    def __init__(self, n):
        self.n = n
        self.tree = [[] for _ in range(n)]
        self.root = None

    def add_edge(self, u, v, c):
        if u > v: u, v = v, u
        self.tree[u].append((v, c))
        self.tree[v].append((u, c))

    def set_root(self, r=0):
        self.root = r
        self.par = [None] * self.n
        self.ord = [r]
        self.cost = [0] * N
        stack = [r]
        while stack:
            v = stack.pop()
            for adj, cost in self.tree[v]:
                if self.par[v] == adj: continue
                self.cost[adj] = cost
                self.par[adj] = v
                self.ord.append(adj)
                stack.append(adj)

    def rerooting(self, op, e, merge, id):
        if self.root is None: self.set_root()
        dp = [e] * self.n
        lt = [id] * self.n
        rt = [id] * self.n
        inv = [id] * self.n
        for v in self.ord[::-1]:
            tl = tr = e
            for adj, cost in self.tree[v]:
                if self.par[v] == adj: continue
                lt[adj] = tl
                tl = op(tl, dp[adj], cost)
            for adj, cost in self.tree[v][::-1]:
                if self.par[v] == adj: continue
                rt[adj] = tr
                tr = op(tr, dp[adj], cost)
            dp[v] = tr
        for v in self.ord:
            if v == self.root: continue
            p = self.par[v]
            inv[v] = op(merge(lt[v], rt[v]), inv[p], self.cost[p])
            dp[v] = op(dp[v], inv[v], self.cost[v])
        return dp

import io, os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

MOD = 1000000007

N = int(input())

t = Tree(N)

for _ in range(N - 1):
    u, v, w = map(int, input().split())
    u -= 1; v -= 1
    t.add_edge(u, v, w)

def op(p, v, d):
    p_size, p_dist, p_square = p
    v_size, v_dist, v_square = v
    size = p_size + v_size
    dist = (p_dist + v_dist + d * v_size) % MOD
    square = (p_square + v_square + d**2 * v_size + 2 * d * v_dist) % MOD
    return size, dist, square

def merge(lt, rt):
    l_size, l_dist, l_square = lt
    r_size, r_dist, r_square = rt
    size = l_size + r_size - 1
    dist = (l_dist + r_dist) % MOD
    square = (l_square + r_square) % MOD
    return size, dist, square

dp = t.rerooting(op, (1, 0, 0), merge, (0, 0, 0))

res = 0

for size, dist, square in dp:
    res += square
    res %= MOD

print(res * pow(2, MOD - 2, MOD) % MOD)
0