题目
题目链接
![](https://i-blog.csdnimg.cn/blog_migrate/4064b929052de771219a7aba2f37c706.png)
题目注意
- 大家都知道是最短路问题,然后大家也都清楚可以用dij,可是这题最大的 坑有两个:
- 结果需要用long long
- 题目会多次输入a->b之间的边,也就是两点之间可能存在多条边到达,所以需要更新a->b之间最小的边为图上的权值。故不能用邻接表法去存图,需要用邻接矩阵!
解题代码
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define MAXN 1005
int n,m,s,t;
ll mmp[MAXN][MAXN];
bool* visit;
ll * dist;
const ll inf = 1e18;
int findMin(){
int minN = -1;
ll minV = inf;
for (int i = 1; i <= n; ++i) {
if(!visit[i]&&minV>dist[i]){
minV = dist[i];
minN = i;
}
}
return minN;
}
void solve(){
while (1){
int node = findMin();
if(node==-1||visit[t])
return;
visit[node] = 1;
for (int i = 1; i <= n; ++i) {
if(!visit[i]&&mmp[node][i]!=inf&&(dist[i]>dist[node]+mmp[node][i])){
dist[i] = dist[node]+mmp[node][i];
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin>>n>>m>>s>>t;
visit = new bool[n+1];
dist = new ll[n+1];
fill(mmp[0],mmp[0]+MAXN*MAXN,inf);
memset(visit,0,(n+1)*sizeof(bool));
fill(dist, dist+n+1, inf);
ll a,b,c;
while (m--){
cin>>a>>b>>c;
mmp[a][b] = min(mmp[a][b],c);
mmp[b][a] = mmp[a][b];
}
visit[s] = true;
dist[s] = 0;
for (int i = 1; i <= n; ++i) {
if(mmp[s][i]!=inf){
dist[i] = mmp[s][i];
}
}
solve();
if(visit[t])cout<<dist[t];
else cout<<-1;
return 0;
}