简单的最短路——Dijkstra(1)
题目来源:洛谷 P3371 【模板】单源最短路径(弱化版)
共十个测试点
题解
WA代码1
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 5;
#define inf 0x3f3f3f3f
typedef long long ll;
ll dis[maxn], vis[maxn];
int n, m, s;
struct Node
{
int v, w;
Node(int x, int y) : v(x), w(y) {}
};
vector<Node> G[maxn];
void addedge(int u, int v, int w)
{
G[u].push_back((Node){v, w});
}
void init()
{
memset(dis, inf, sizeof(dis));
memset(vis, 0, sizeof(vis));
}
void dijkstra()
{
init();
dis[s] = 0;
while (1)
{
int pos = -1, minn = inf;
for (int i = 1; i <= n; ++i)
{
if (vis[i] == 0 && dis[i] < minn)
{
minn = dis[i];
pos = i;
}
}
if (pos == -1)
break;
vis[pos] = 1;
for (int i = 0; i < G[pos].size(); ++i)
{
int v = G[pos][i].v, w = G[pos][i].w;
if (vis[v] == 0 && dis[v] > dis[pos] + w)
{
dis[v] = dis[pos] + w;
}
}
}
}
int main()
{
scanf("%d%d%d", &n, &m, &s);
for (int i = 1; i <= m; ++i)
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
addedge(x, y, z);
}
dijkstra();
for (int i = 1; i <= n; ++i)
printf("%d ", dis[i]);
return 0;
}
错误分析
inf = 0x3f3f3f3f
适用于 int 类型
long long 类型需要inf =0x7fffffff
测试点通过情况
#3 WA
WA代码2
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 5;
#define inf 0x7fffffff
typedef long long ll;
ll dis[maxn], vis[maxn];
int n, m, s;
struct Node
{
int v, w;
Node(int x, int y) : v(x), w(y) {}
};
vector<Node> G[maxn];
void addedge(int u, int v, int w)
{
G[u].push_back((Node){v, w});
}
void init()
{
memset(dis, inf, sizeof(dis));
memset(vis, 0, sizeof(vis));
}
void dijkstra()
{
init();
dis[s] = 0;
while (1)
{
int pos = -1, minn = inf;
for (int i = 1; i <= n; ++i)
{
if (vis[i] == 0 && dis[i] < minn)
{
minn = dis[i];
pos = i;
}
}
if (pos == -1)
break;
vis[pos] = 1;
for (int i = 0; i < G[pos].size(); ++i)
{
int v = G[pos][i].v, w = G[pos][i].w;
if (vis[v] == 0 && dis[v] > dis[pos] + w)
{
dis[v] = dis[pos] + w;
}
}
}
}
int main()
{
scanf("%d%d%d", &n, &m, &s);
for (int i = 1; i <= m; ++i)
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
addedge(x, y, z);
}
dijkstra();
for (int i = 1; i <= n; ++i)
printf("%d ", dis[i]);
return 0;
}
错误分析
inf = 0x7fffffff
不能使用 memset() 初始化
测试点通过情况
#1 ~ #10 WA
AC代码
// 未进行堆优化的 Dijkstra 算法
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 5;
// long long 类型最大值
#define inf 0x7fffffff
typedef long long ll;
// dis[x] 表示第 x 点到起点的距离
// vis[x] == 1 表示第 x 点已经被固定
ll dis[maxn], vis[maxn];
int n, m, s;
// 结构体存图
struct Node
{
int v, w;
Node(int x, int y) : v(x), w(y) {}
};
// G[x] 表示 x 为起点
// G[x][y] 表示 x 为起点时,编号为 y 的边(初始编号为 0 )
// G[x][y].v,G[x][y].w 分别表示 x 为起点时,编号为 y 的边的终点和权值
vector<Node> G[maxn];
// 存图函数
void addedge(int u, int v, int w)
{
// (Node){v, w} 对应 Node 结构体的构造函数
G[u].push_back((Node){v, w});
}
// 初始化 dis 和 vis 数组
void init()
{
for (int i = 1; i <= n; ++i)
dis[i] = inf;
memset(vis, 0, sizeof(vis));
}
// Dijkstra算法
void dijkstra()
{
init();
// 起点距离初始化
dis[s] = 0;
while (1)
{
int pos = -1, minn = inf;
for (int i = 1; i <= n; ++i)
{
// 当 x 点未被标记,并且到起点的距离小于 inf
// 选出最短距离的未标记的点
if (vis[i] == 0 && dis[i] < minn)
{
minn = dis[i];
pos = i;
}
}
// pos == -1 表示所有的点都已经计算了
if (pos == -1)
break;
// 标记起点
vis[pos] = 1;
// 对起点的终点遍历
for (int i = 0; i < G[pos].size(); ++i)
{
int v = G[pos][i].v, w = G[pos][i].w;
// 如果终点未被标记,并且 dis[终点] 大于 (权值 + dis[pos])
if (vis[v] == 0 && dis[v] > dis[pos] + w)
{
dis[v] = dis[pos] + w;
}
}
}
}
int main()
{
scanf("%d%d%d", &n, &m, &s);
for (int i = 1; i <= m; ++i)
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
addedge(x, y, z);
}
dijkstra();
for (int i = 1; i <= n; ++i)
printf("%d ", dis[i]);
return 0;
}