1.题目描述:
最短路
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 61286 Accepted Submission(s): 26935
Problem Description
在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗?
Input
输入包括多组数据。每组数据第一行是两个整数N、M(N<=100,M<=10000),N表示成都的大街上有几个路口,标号为1的路口是商店所在地,标号为N的路口是赛场所在地,M则表示在成都有几条路。N=M=0表示输入结束。接下来M行,每行包括3个整数A,B,C(1<=A,B<=N,1<=C<=1000),表示在路口A与路口B之间有一条路,我们的工作人员需要C分钟的时间走过这条路。
输入保证至少存在1条商店到赛场的路线。
输入保证至少存在1条商店到赛场的路线。
Output
对于每组输入,输出一行,表示工作人员从商店走到赛场的最短时间
Sample Input
2 1 1 2 3 3 3 1 2 5 2 3 5 3 1 2 0 0
Sample Output
3 2
Source
Recommend
从1到n的模板题最短路。
4.AC代码:
01 - dijkstra解法:
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 100100
#define N 111
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
int mp[N][N], dis[N];
bool vis[N];
void init(int n)
{
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++)
mp[i][j] = INF;
}
int dijkstra(int sta, int ed)
{
for (int i = 1; i <= ed; i++)
{
dis[i] = mp[sta][i];
vis[i] = 0;
}
vis[sta] = 1;
dis[sta] = 0;
for (int i = 1; i < ed; i++)
{
int m = INF;
int u = i;
for (int j = 1; j <= ed; j++) //贪心地找最小边的顶点
if (!vis[j] && m > dis[j])
{
m = dis[j];
u = j;
}
if (m == INF) //没啥可以松弛的了
break;
vis[u] = 1; //松弛最小边对应的顶点
for (int j = 1; j <= ed; j++)
if (!vis[j] && dis[j] > dis[u] + mp[u][j])
dis[j] = dis[u] + mp[u][j];
}
return dis[ed];
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
long _begin_time = clock();
#endif
int n, m;
while (~scanf("%d%d", &n, &m), n + m)
{
init(n);
for (int i = 0; i < m; i++)
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
mp[a][b] = c;
mp[b][a] = c;
}
int ans = dijkstra(1, n);
printf("%d\n", ans);
}
#ifndef ONLINE_JUDGE
long _end_time = clock();
printf("time = %ld ms.", _end_time - _begin_time);
#endif
return 0;
}
02 - spfa解法:
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 111
#define eps 1e-6
#define pi acos(-1.0)
#define e 2.718281828459
#define mod (int)1e9 + 7
using namespace std;
typedef long long ll;
int mp[maxn][maxn], dis[maxn], vis[maxn];
int n, m;
int spfa(int sta, int ed)
{
queue<int> q;
memset(vis, 0, sizeof(vis));
for (int i = 0; i <= n; i++)
dis[i] = INF;
dis[sta] = 0;
vis[sta] = 1;
q.push(sta);
while (!q.empty())
{
int cur = q.front();
q.pop();
vis[cur] = 0;
for (int i = 1; i <= n; i++)
{
if (dis[i] > dis[cur] + mp[cur][i])
{
dis[i] = dis[cur] + mp[cur][i];
if (!vis[i])
{
q.push(i);
vis[i] = 1;
}
}
}
}
return dis[ed];
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
long _begin_time = clock();
#endif
while (scanf("%d%d", &n, &m) != EOF && n + m)
{
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
mp[i][j] = INF;
for (int i = 0; i < m; i++)
{
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
if (w < mp[u][v])
mp[u][v] = mp[v][u] = w;
}
printf("%d\n", spfa(1, n));
}
#ifndef ONLINE_JUDGE
long _end_time = clock();
printf("time = %ld ms.", _end_time - _begin_time);
#endif
return 0;
}
ps:有一段时间没写题解了,实在是太忙了最近,不过还是决定要慢下来,现在是最短路专题,集训时候忙着拍spfa,可能当时有点惧怕吧,不过现在慢下来啃一啃原理,还是 有助于我理解的hhh