結果

問題 No.3111 Toll Optimization
コンテスト
ユーザー lif4635
提出日時 2025-04-18 20:27:05
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,851 ms / 5,000 ms
コード長 2,953 bytes
コンパイル時間 491 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 138,496 KB
最終ジャッジ日時 2025-04-18 20:27:50
合計ジャッジ時間 39,370 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 70
権限があれば一括ダウンロードができます

ソースコード

diff # 

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge

def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


n,m,k = MI()
c = LI()

edge = [[] for i in range(n)]
for i in range(m):
    u,v = MI_1()
    edge[u].append((v, c[i]))
    edge[v].append((u, c[i]))


start = 0
dis = [[inf]*(k+1) for i in range(n)]
dis[start][0] = 0
que = [(0, start, 0)]
while que:
    cur_dis, cur_node, cp = heappop(que)

    if dis[cur_node][cp] < cur_dis:
        continue

    for next_node, weight in edge[cur_node]:
        next_dis = cur_dis + weight
        
        if next_dis < dis[next_node][cp]:
            dis[next_node][cp] = next_dis
            heappush(que, (next_dis, next_node, cp))

        if cp != k and cur_dis < dis[next_node][cp+1]: 
            dis[next_node][cp+1] = cur_dis
            heappush(que, (cur_dis, next_node, cp+1))

prinf(min(dis[-1]))
0