結果

問題 No.1320 Two Type Min Cost Cycle
ユーザー 草苺奶昔草苺奶昔
提出日時 2023-04-02 19:16:48
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 817 ms / 2,000 ms
コード長 2,369 bytes
コンパイル時間 445 ms
コンパイル使用メモリ 81,592 KB
実行使用メモリ 83,240 KB
最終ジャッジ日時 2023-10-25 05:10:01
合計ジャッジ時間 15,479 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
67,612 KB
testcase_01 AC 55 ms
67,612 KB
testcase_02 AC 56 ms
67,612 KB
testcase_03 AC 54 ms
67,612 KB
testcase_04 AC 56 ms
67,612 KB
testcase_05 AC 59 ms
67,612 KB
testcase_06 AC 57 ms
67,612 KB
testcase_07 AC 83 ms
77,144 KB
testcase_08 AC 109 ms
77,752 KB
testcase_09 AC 636 ms
81,180 KB
testcase_10 AC 104 ms
78,556 KB
testcase_11 AC 516 ms
81,092 KB
testcase_12 AC 186 ms
79,320 KB
testcase_13 AC 320 ms
79,888 KB
testcase_14 AC 60 ms
72,188 KB
testcase_15 AC 105 ms
78,648 KB
testcase_16 AC 179 ms
78,424 KB
testcase_17 AC 79 ms
76,952 KB
testcase_18 AC 75 ms
76,736 KB
testcase_19 AC 384 ms
80,280 KB
testcase_20 AC 62 ms
71,708 KB
testcase_21 AC 616 ms
82,024 KB
testcase_22 AC 57 ms
67,612 KB
testcase_23 AC 57 ms
67,612 KB
testcase_24 AC 56 ms
67,612 KB
testcase_25 AC 55 ms
67,612 KB
testcase_26 AC 56 ms
67,612 KB
testcase_27 AC 55 ms
67,612 KB
testcase_28 AC 73 ms
76,744 KB
testcase_29 AC 160 ms
78,912 KB
testcase_30 AC 62 ms
70,468 KB
testcase_31 AC 92 ms
77,300 KB
testcase_32 AC 55 ms
67,612 KB
testcase_33 AC 292 ms
79,236 KB
testcase_34 AC 190 ms
78,848 KB
testcase_35 AC 141 ms
78,120 KB
testcase_36 AC 131 ms
78,256 KB
testcase_37 AC 106 ms
77,780 KB
testcase_38 AC 148 ms
77,980 KB
testcase_39 AC 135 ms
77,992 KB
testcase_40 AC 58 ms
67,612 KB
testcase_41 AC 56 ms
67,612 KB
testcase_42 AC 56 ms
67,612 KB
testcase_43 AC 147 ms
79,472 KB
testcase_44 AC 131 ms
78,944 KB
testcase_45 AC 817 ms
81,948 KB
testcase_46 AC 94 ms
77,504 KB
testcase_47 AC 172 ms
78,940 KB
testcase_48 AC 414 ms
80,192 KB
testcase_49 AC 107 ms
77,800 KB
testcase_50 AC 57 ms
67,612 KB
testcase_51 AC 56 ms
67,612 KB
testcase_52 AC 190 ms
78,096 KB
testcase_53 AC 152 ms
78,148 KB
testcase_54 AC 699 ms
83,092 KB
testcase_55 AC 695 ms
82,636 KB
testcase_56 AC 700 ms
82,492 KB
testcase_57 AC 661 ms
83,124 KB
testcase_58 AC 647 ms
83,240 KB
testcase_59 AC 645 ms
83,160 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:
    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]
        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, next) == (start, target) or (cur, next) == (target, 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, next) == (start, target) or (cur, next) == (target, 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