結果

問題 No.1320 Two Type Min Cost Cycle
ユーザー 草苺奶昔草苺奶昔
提出日時 2023-04-02 19:19:21
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 870 ms / 2,000 ms
コード長 2,491 bytes
コンパイル時間 503 ms
コンパイル使用メモリ 82,428 KB
実行使用メモリ 83,520 KB
最終ジャッジ日時 2024-09-25 00:36:45
合計ジャッジ時間 15,327 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
67,560 KB
testcase_01 AC 61 ms
67,432 KB
testcase_02 AC 62 ms
67,820 KB
testcase_03 AC 62 ms
67,696 KB
testcase_04 AC 61 ms
68,524 KB
testcase_05 AC 62 ms
67,276 KB
testcase_06 AC 61 ms
67,844 KB
testcase_07 AC 94 ms
77,652 KB
testcase_08 AC 118 ms
78,512 KB
testcase_09 AC 680 ms
81,876 KB
testcase_10 AC 112 ms
79,200 KB
testcase_11 AC 549 ms
81,300 KB
testcase_12 AC 202 ms
80,060 KB
testcase_13 AC 341 ms
80,688 KB
testcase_14 AC 68 ms
72,736 KB
testcase_15 AC 115 ms
79,228 KB
testcase_16 AC 190 ms
79,048 KB
testcase_17 AC 85 ms
77,676 KB
testcase_18 AC 85 ms
77,496 KB
testcase_19 AC 417 ms
80,744 KB
testcase_20 AC 69 ms
72,728 KB
testcase_21 AC 685 ms
82,104 KB
testcase_22 AC 63 ms
67,620 KB
testcase_23 AC 62 ms
67,876 KB
testcase_24 AC 64 ms
68,236 KB
testcase_25 AC 64 ms
68,228 KB
testcase_26 AC 63 ms
68,424 KB
testcase_27 AC 64 ms
67,428 KB
testcase_28 AC 82 ms
77,384 KB
testcase_29 AC 166 ms
79,544 KB
testcase_30 AC 71 ms
71,500 KB
testcase_31 AC 101 ms
77,840 KB
testcase_32 AC 64 ms
67,384 KB
testcase_33 AC 312 ms
80,108 KB
testcase_34 AC 205 ms
79,448 KB
testcase_35 AC 156 ms
78,692 KB
testcase_36 AC 142 ms
78,984 KB
testcase_37 AC 119 ms
78,312 KB
testcase_38 AC 157 ms
78,736 KB
testcase_39 AC 146 ms
79,120 KB
testcase_40 AC 64 ms
68,076 KB
testcase_41 AC 63 ms
68,060 KB
testcase_42 AC 62 ms
67,848 KB
testcase_43 AC 157 ms
80,116 KB
testcase_44 AC 139 ms
79,524 KB
testcase_45 AC 870 ms
82,640 KB
testcase_46 AC 102 ms
78,112 KB
testcase_47 AC 188 ms
79,460 KB
testcase_48 AC 459 ms
80,676 KB
testcase_49 AC 110 ms
78,088 KB
testcase_50 AC 63 ms
67,712 KB
testcase_51 AC 63 ms
68,500 KB
testcase_52 AC 201 ms
79,120 KB
testcase_53 AC 162 ms
78,604 KB
testcase_54 AC 754 ms
83,384 KB
testcase_55 AC 743 ms
83,272 KB
testcase_56 AC 754 ms
83,388 KB
testcase_57 AC 720 ms
83,432 KB
testcase_58 AC 710 ms
83,520 KB
testcase_59 AC 706 ms
83,132 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