2026/7/31 1:07:16
python
import heapq
from typing import Listclass Solution:def minTimeMaxPower(self, n: int, edges: List[List[int]], power: int, cost: List[int], source: int, target: int) -> List[int]:# 建图graph [[] for _ in range(n)]for u, v, t in edges:graph[u].appe…