結果

問題 No.1320 Two Type Min Cost Cycle
ユーザー 草苺奶昔草苺奶昔
提出日時 2023-04-02 19:19:21
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 920 ms / 2,000 ms
コード長 2,491 bytes
コンパイル時間 385 ms
コンパイル使用メモリ 81,480 KB
実行使用メモリ 83,016 KB
最終ジャッジ日時 2023-10-25 05:10:21
合計ジャッジ時間 17,258 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
67,492 KB
testcase_01 AC 64 ms
67,492 KB
testcase_02 AC 63 ms
67,492 KB
testcase_03 AC 62 ms
67,492 KB
testcase_04 AC 63 ms
67,492 KB
testcase_05 AC 65 ms
67,492 KB
testcase_06 AC 64 ms
67,492 KB
testcase_07 AC 95 ms
77,052 KB
testcase_08 AC 123 ms
77,588 KB
testcase_09 AC 707 ms
81,160 KB
testcase_10 AC 114 ms
78,500 KB
testcase_11 AC 580 ms
80,852 KB
testcase_12 AC 215 ms
79,336 KB
testcase_13 AC 367 ms
79,920 KB
testcase_14 AC 70 ms
72,036 KB
testcase_15 AC 121 ms
78,576 KB
testcase_16 AC 202 ms
78,304 KB
testcase_17 AC 89 ms
76,880 KB
testcase_18 AC 87 ms
76,660 KB
testcase_19 AC 439 ms
80,128 KB
testcase_20 AC 69 ms
71,588 KB
testcase_21 AC 706 ms
81,524 KB
testcase_22 AC 63 ms
67,492 KB
testcase_23 AC 63 ms
67,492 KB
testcase_24 AC 65 ms
67,492 KB
testcase_25 AC 63 ms
67,492 KB
testcase_26 AC 65 ms
67,492 KB
testcase_27 AC 64 ms
67,492 KB
testcase_28 AC 84 ms
76,680 KB
testcase_29 AC 174 ms
78,820 KB
testcase_30 AC 72 ms
70,388 KB
testcase_31 AC 104 ms
77,224 KB
testcase_32 AC 64 ms
67,492 KB
testcase_33 AC 330 ms
79,164 KB
testcase_34 AC 211 ms
78,784 KB
testcase_35 AC 160 ms
78,120 KB
testcase_36 AC 148 ms
78,188 KB
testcase_37 AC 123 ms
77,536 KB
testcase_38 AC 164 ms
77,904 KB
testcase_39 AC 154 ms
77,924 KB
testcase_40 AC 64 ms
67,492 KB
testcase_41 AC 64 ms
67,492 KB
testcase_42 AC 63 ms
67,492 KB
testcase_43 AC 168 ms
79,408 KB
testcase_44 AC 143 ms
78,880 KB
testcase_45 AC 920 ms
81,992 KB
testcase_46 AC 103 ms
77,256 KB
testcase_47 AC 192 ms
78,876 KB
testcase_48 AC 495 ms
80,124 KB
testcase_49 AC 114 ms
77,540 KB
testcase_50 AC 65 ms
67,492 KB
testcase_51 AC 65 ms
67,492 KB
testcase_52 AC 214 ms
78,140 KB
testcase_53 AC 168 ms
77,976 KB
testcase_54 AC 798 ms
82,724 KB
testcase_55 AC 798 ms
82,696 KB
testcase_56 AC 796 ms
82,652 KB
testcase_57 AC 752 ms
82,996 KB
testcase_58 AC 765 ms
83,016 KB
testcase_59 AC 745 ms
82,836 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import deque
from heapq import heappop, heappush
from typing import List, Tuple

INF = int(1e18)


def minCostCycle(n: int, edges: List[Tuple[int, int, int]], directed: bool) -> int:
    """O(E*(V+E)*logV)求最小环权值和,不存在返回INF"""
    adjList = [[] for _ in range(n)]
    maxWeight = 0
    for u, v, w in edges:
        if w > maxWeight:
            maxWeight = w
        adjList[u].append((v, w))
        if not directed:
            adjList[v].append((u, w))
    res = INF
    for i in range(len(edges)):  # remove edge i
        from_, to, weight = edges[i]  # 注意有向图时最短路需要to->from
        dist = _bfs01(adjList, to, from_) if maxWeight <= 1 else _dijkstra(adjList, to, from_)
        cand = weight + dist
        if cand < res:
            res = cand
    return res


def _bfs01(adjList: List[List[Tuple[int, int]]], start: int, target: int) -> int:
    n = len(adjList)
    dist = [INF] * n
    dist[start] = 0
    queue = deque([start])
    while queue:
        cur = queue.popleft()
        if cur == target:
            return dist[cur]
        for next, weight in adjList[cur]:
            if (cur == start and next == target) or (cur == target and next == start):
                continue
            cand = dist[cur] + weight
            if cand < dist[next]:
                dist[next] = cand
                if weight == 0:
                    queue.appendleft(next)
                else:
                    queue.append(next)
    return INF


def _dijkstra(adjList: List[List[Tuple[int, int]]], start: int, target: int) -> int:
    n = len(adjList)
    dist = [INF] * n
    dist[start] = 0
    pq = [(0, start)]
    while pq:
        curDist, cur = heappop(pq)
        if cur == target:
            return curDist
        if dist[cur] < curDist:
            continue
        for next, weight in adjList[cur]:
            if (cur == start and next == target) or (cur == target and next == start):
                continue
            cand = curDist + weight
            if cand < dist[next]:
                dist[next] = cand
                heappush(pq, (cand, next))
    return INF


if __name__ == "__main__":
    directed = int(input())
    n, m = map(int, input().split())
    edges = []
    for _ in range(m):
        u, v, w = map(int, input().split())
        u -= 1
        v -= 1
        edges.append((u, v, w))
    res = minCostCycle(n, edges, directed == 1)
    if res == INF:
        res = -1
    print(res)
0