今天模拟赛很奔,模板题不会写了,最短路现在我发四我能背下来(memset是咋回事,以后只能用来清零了,其他不能用),凭借能力用BFS A掉了最短路(所有权重为1),第一题的迷宫明明做过一遍,又忘记思路了吗?最后突然变聪明,一分钟不到三四行代码带走汉诺塔哈哈,就剩迷宫了,这次你跑不了。附我丑怕的Dijkstra:
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#define ll long long
#define vi vector<int>
#define si set<int>
#define pi pair<int,int>
#define pii pair<ll,ll>
#define pb push_back
#define mp make_pair
#define lowbit(x) (x&(-x))
#define sci(x) scanf("%d",&(x))
#define scll(x) scanf("%lld",&(x))
#define sclf(x) scanf("%lf",&(x))
#define pri(x) printf("%d",(x))
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
#define mem(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3
using namespace std;
int a[1005][1005];
int dis[1005];
int vis[1005];
int main()
{
int n,m;
while(cin>>n>>m&&(m||n)){
memset(a,INF,sizeof(a[0]));
memset(dis,INF,sizeof(dis));
memset(vis,0,sizeof(vis));
for(int i=0;i<m;i++){
int A,B,C;
cin>>A>>B>>C;
a[A][B] = C;
a[B][A] = C;
}
vis[1] = 1;//set
for(int i=1;i<=n;i++){
dis[i] = a[1][i];
}
for(int k=1;k<=n;k++){
int mp=INF,mid=1;
for(int i=1;i<=n;i++){
if(vis[i]==0&&dis[i]<mp){
mp = dis[i];
mid = i;
}
}
vis[mid] = 1;
for(int i=1;i<=n;i++){
if(vis[i]==0&&dis[i]>dis[mid]+a[mid][i]){//松弛
dis[i] = dis[mid]+a[mid][i];
}
}
}
cout<<dis[n]<<endl;
}
return 0;
}