【天梯】python L2-001 城市间紧急救援 (25 point(s))

救命这个也超时

1.最短路径
2.最短路径条数
3.最大资源

n,m,s,d=map(int,input().split())
x=list(map(int,input().split()))#资源
city=[[float('inf') for i in range(n)]for j in range(n)]
dis=[float('inf') for i in range(n)]
vis=[-1 for i in range(n)]#记录顶点
num=[0 for i in range(n)]#最短路径条数
w=[0 for i in range(n)]#最大资源
pre=[i for i in range(n)]#记录前驱

for i in range(m):
    a,b,c=map(int,input().split())
    city[a][b]=c
    city[b][a]=c
def dijkstra(s):
    dis[s]=0
    num[s]=1
    w[s]=x[s]
    for i in range(n-1):
        mi=float('inf')
        u=0
        for j in range(n):
            if vis[j]==-1 and  dis[j]<mi:
                mi=dis[j]
                u=j
        if u==-1:
            return
        vis[u]=1#访问距离最近的点
        for v in range(n):#更新前驱
            if vis[v]==-1:                
                if dis[v]>dis[u]+city[u][v]:
                    dis[v]=dis[u]+city[u][v]
                    num[v]=num[u]
                    w[v]=w[u]+x[v]
                    pre[v]=u
                elif dis[v]==dis[u]+city[u][v]:
                    num[v]+=num[u]
                    if(w[v]<w[u]+x[v]):
                        w[v]=w[u]+x[v]
                        pre[v]=u
dijkstra(s)
print("%d %d"%(num[d],w[d]))
k=[]
def dfs(s,d):
    if s==d:
        k.append(s)
        return
    dfs(s,pre[d])
    k.append(d)
dfs(s,d)
print(*k)