結果

問題 No.1320 Two Type Min Cost Cycle
コンテスト
ユーザー ningenMe
提出日時 2020-12-02 20:55:08
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,434 ms / 2,000 ms
コード長 2,643 bytes
コンパイル時間 147 ms
コンパイル使用メモリ 81,652 KB
実行使用メモリ 93,820 KB
最終ジャッジ日時 2024-09-20 01:20:46
合計ジャッジ時間 16,617 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 57
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
import heapq
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

inf = 1e15

def solve_undirected_graph():
    N, M = map(int, readline().split())
    edges = [[] for i in range(N)]
    for i in range(M):
        u, v, w = map(int, readline().split())
        u-=1
        v-=1
        edges[u].append((v,w))
        edges[v].append((u,w))
    ans = inf
    for root in range(N):
        dist  = [inf for i in range(N)]
        label = [-1 for i in range(N)]
        q = [0<<13 | root]
        dist[root]  = 0
        label[root] = root

        while len(q) > 0:
            cost,from_node = divmod(heapq.heappop(q),1 << 13)
            if cost > dist[from_node]:
                continue
            for to_node,w in edges[from_node]:
                new_cost = cost+w
                if dist[to_node] > new_cost:
                    dist[to_node] = new_cost
                    if from_node == root:
                        label[to_node] = to_node
                    else :
                        label[to_node] = label[from_node]
                    heapq.heappush(q,(new_cost<<13 | to_node))
        for from_node in range(N):
            for to_node,w in edges[from_node]:
                if from_node == root or to_node == root:
                    continue
                if label[from_node] == label[to_node]:
                    continue
                if ans > dist[from_node] + dist[to_node] + w:
                    ans = dist[from_node] + dist[to_node] + w
    return ans

def solve_directed_graph():
    N, M = map(int, readline().split())
    edges = [[] for i in range(N)]
    for i in range(M):
        u, v, w = map(int, readline().split())
        u-=1
        v-=1
        edges[u].append((v,w))
    ans = inf
    for root in range(N):
        dist  = [inf for i in range(N)]
        q = [0<<13 | root]
        dist[root]  = 0

        while len(q) > 0:
            cost,from_node = divmod(heapq.heappop(q),1 << 13)
            if cost > dist[from_node]:
                continue
            for to_node,w in edges[from_node]:
                new_cost = cost+w
                if dist[to_node] > new_cost:
                    dist[to_node] = new_cost
                    heapq.heappush(q,(new_cost<<13 | to_node))
                if to_node == root and ans > dist[from_node] + w:
                    ans = dist[from_node] + w
    return ans

def main():
    T = int(readline())
    ans = inf
    if T == 0:
        ans = solve_undirected_graph()
    else:
        ans = solve_directed_graph()
    if ans == inf:
        ans = -1
    print(ans)

main()
0