結果

問題 No.1320 Two Type Min Cost Cycle
ユーザー ningenMeningenMe
提出日時 2020-12-02 20:55:08
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,704 ms / 2,000 ms
コード長 2,643 bytes
コンパイル時間 170 ms
コンパイル使用メモリ 81,704 KB
実行使用メモリ 93,120 KB
最終ジャッジ日時 2023-10-20 05:40:54
合計ジャッジ時間 18,654 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
53,492 KB
testcase_01 AC 41 ms
53,492 KB
testcase_02 AC 41 ms
53,492 KB
testcase_03 AC 41 ms
53,492 KB
testcase_04 AC 40 ms
53,492 KB
testcase_05 AC 56 ms
70,532 KB
testcase_06 AC 49 ms
65,320 KB
testcase_07 AC 98 ms
75,888 KB
testcase_08 AC 246 ms
77,180 KB
testcase_09 AC 1,177 ms
88,160 KB
testcase_10 AC 116 ms
76,276 KB
testcase_11 AC 946 ms
85,672 KB
testcase_12 AC 410 ms
78,992 KB
testcase_13 AC 658 ms
82,024 KB
testcase_14 AC 141 ms
76,188 KB
testcase_15 AC 109 ms
76,348 KB
testcase_16 AC 101 ms
75,912 KB
testcase_17 AC 85 ms
76,228 KB
testcase_18 AC 78 ms
75,740 KB
testcase_19 AC 407 ms
78,416 KB
testcase_20 AC 108 ms
76,188 KB
testcase_21 AC 749 ms
79,620 KB
testcase_22 AC 40 ms
53,492 KB
testcase_23 AC 40 ms
53,492 KB
testcase_24 AC 40 ms
53,492 KB
testcase_25 AC 40 ms
53,492 KB
testcase_26 AC 40 ms
53,492 KB
testcase_27 AC 40 ms
53,492 KB
testcase_28 AC 169 ms
76,256 KB
testcase_29 AC 175 ms
76,576 KB
testcase_30 AC 54 ms
64,240 KB
testcase_31 AC 89 ms
75,812 KB
testcase_32 AC 40 ms
53,492 KB
testcase_33 AC 543 ms
80,716 KB
testcase_34 AC 375 ms
78,348 KB
testcase_35 AC 102 ms
75,980 KB
testcase_36 AC 71 ms
70,500 KB
testcase_37 AC 60 ms
66,336 KB
testcase_38 AC 116 ms
76,016 KB
testcase_39 AC 89 ms
75,856 KB
testcase_40 AC 40 ms
53,492 KB
testcase_41 AC 40 ms
53,492 KB
testcase_42 AC 40 ms
53,492 KB
testcase_43 AC 145 ms
76,820 KB
testcase_44 AC 133 ms
76,560 KB
testcase_45 AC 1,704 ms
93,120 KB
testcase_46 AC 89 ms
75,868 KB
testcase_47 AC 513 ms
81,144 KB
testcase_48 AC 591 ms
81,056 KB
testcase_49 AC 99 ms
76,032 KB
testcase_50 AC 41 ms
53,492 KB
testcase_51 AC 40 ms
53,492 KB
testcase_52 AC 248 ms
76,976 KB
testcase_53 AC 168 ms
76,580 KB
testcase_54 AC 544 ms
79,900 KB
testcase_55 AC 545 ms
79,624 KB
testcase_56 AC 544 ms
79,896 KB
testcase_57 AC 1,155 ms
89,296 KB
testcase_58 AC 1,166 ms
89,028 KB
testcase_59 AC 1,187 ms
89,140 KB
権限があれば一括ダウンロードができます

ソースコード

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