A - 最短路
在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗?
输入保证至少存在1条商店到赛场的路线。
2 1
1 2 3
3 3
1 2 5
2 3 5
3 1 2
0 0
3
2
题意:有n个路口,m条路,通过一条路的花费为c,问从点1到点n的最小花费是多少。
分析:最基础的最短路,下面给出dijkstra和spfa两种做法。
代码如下:
dijkstra做法:
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int MX = 105;
int mp[MX][MX];
int dis[MX];
int vis[MX];
int n, m;
void dijkstra(int s){
memset(vis, 0, sizeof(vis));
memset(dis, INF, sizeof(dis));
dis[s] = 0;
for(int i = 1; i <= n; i++){
int mindis = INF, k = -1;
for(int j = 1; j <= n; j++){
if(!vis[j] && dis[j] < mindis){
mindis = dis[j];
k = j;
}
}
vis[k] = 1;
for(int j = 1; j <= n; j++){
if(dis[j] > dis[k] + mp[k][j]){
dis[j] = dis[k] + mp[k][j];
}
}
}
}
int main(){
while(~scanf("%d%d", &n, &m), n || m){
memset(mp, INF, sizeof(mp));
for(int i = 0; i < m; i++){
int u, v, s;
scanf("%d%d%d", &u, &v, &s);
mp[u][v] = mp[v][u] = s;
}
dijkstra(1);
printf("%d\n", dis[n]);
}
return 0;
}
spfa做法:
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int MX = 105;
int mp[MX][MX];
int dis[MX];
int vis[MX];
int n, m;
void dijkstra(int s){
memset(vis, 0, sizeof(vis));
memset(dis, INF, sizeof(dis));
dis[s] = 0;
for(int i = 1; i <= n; i++){
int mindis = INF, k = -1;
for(int j = 1; j <= n; j++){
if(!vis[j] && dis[j] < mindis){
mindis = dis[j];
k = j;
}
}
vis[k] = 1;
for(int j = 1; j <= n; j++){
if(dis[j] > dis[k] + mp[k][j]){
dis[j] = dis[k] + mp[k][j];
}
}
}
}
int main(){
while(~scanf("%d%d", &n, &m), n || m){
memset(mp, INF, sizeof(mp));
for(int i = 0; i < m; i++){
int u, v, s;
scanf("%d%d%d", &u, &v, &s);
mp[u][v] = mp[v][u] = s;
}
dijkstra(1);
printf("%d\n", dis[n]);
}
return 0;
}
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int MX = 105;
int mp[MX][MX];
int dis[MX];
int inq[MX];
int n, m;
void spfa(int s){
memset(dis, INF, sizeof(dis));
memset(inq, 0, sizeof(inq));
queue<int> q;
q.push(s);
inq[s] = 1;
dis[s] = 0;
while(!q.empty()){
int u = q.front();
q.pop();
inq[u] = 0;
for(int i = 1; i <= n; i++){
if(dis[i] > dis[u] + mp[u][i]){
dis[i] = dis[u] + mp[u][i];
if(!inq[i]){
q.push(i);
inq[i] = 1;
}
}
}
}
printf("%d\n", dis[n]);
}
int main(){
while(~scanf("%d%d", &n, &m), n || m){
memset(mp, INF, sizeof(mp));
for(int i = 1; i <= m; i++){
int u, v, c;
scanf("%d%d%d", &u, &v, &c);
mp[u][v] = mp[v][u] = c;
}
spfa(1);
}
return 0;
}
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int MX = 105;
int mp[MX][MX];
int dis[MX];
int inq[MX];
int n, m;
void spfa(int s){
memset(dis, INF, sizeof(dis));
memset(inq, 0, sizeof(inq));
queue<int> q;
q.push(s);
inq[s] = 1;
dis[s] = 0;
while(!q.empty()){
int u = q.front();
q.pop();
inq[u] = 0;
for(int i = 1; i <= n; i++){
if(dis[i] > dis[u] + mp[u][i]){
dis[i] = dis[u] + mp[u][i];
if(!inq[i]){
q.push(i);
inq[i] = 1;
}
}
}
}
printf("%d\n", dis[n]);
}
int main(){
while(~scanf("%d%d", &n, &m), n || m){
memset(mp, INF, sizeof(mp));
for(int i = 1; i <= m; i++){
int u, v, c;
scanf("%d%d%d", &u, &v, &c);
mp[u][v] = mp[v][u] = c;
}
spfa(1);
}
return 0;
}