Light_LE @ 2024-10-03 21:33:37
AC 100pts 代码
#include <bits/stdc++.h>
#define maxn 100003
using namespace std;
struct Edge {
int v, w, next;
}edge[200003];
struct Data {
int dis, pos;
bool operator < (const Data &x) const {
return x.dis < dis;
}
};
int n, m, s, head[maxn], vis[maxn], dis[maxn];
int cnt;
priority_queue<Data> q;
void add(int u, int v, int w) {
cnt++;
edge[cnt].v = v;
edge[cnt].w = w;
edge[cnt].next = head[u];
head[u] = cnt;
}
void dijkstra() {
memset(dis, 0x3f, sizeof(dis));
dis[s] = 0;
q.push((Data){0, s});
while (q.size()) {
Data f = q.top();
q.pop();
int pos = f.pos;
if (vis[pos]) {
continue;
}
vis[pos] = 1;
for (int i = head[pos]; i; i = edge[i].next) {
int v = edge[i].v, w = edge[i].w;
if (dis[v] > dis[pos] + w) {
dis[v] = dis[pos] + w;
if (vis[v] == 0) {
q.push((Data){dis[v], v});
}
}
}
}
}
int main() {
//freopen("in.txt", "r", stdin);
ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
cin >> n >> m >> s;
for (int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w;
add(u, v, w);
}
dijkstra();
for (int i = 1; i <= n; i++) {
cout << dis[i] << " ";
}
return 0;
}
其中,我把 add 函数从上述的
void add(int u, int v, int w) {
cnt++;
edge[cnt].v = v;
edge[cnt].w = w;
edge[cnt].next = head[u];
head[u] = cnt;
}
改为了:
void add(int u, int v, int w) {
edge[cnt++].v = v;
edge[cnt].w = w;
edge[cnt].next = head[u];
head[u] = cnt;
}
就会出错啊?
更改后的样例输出变为了:
0 1061109567 2 5
by dongzirui0817 @ 2024-10-03 21:37:11
@Light_LE 你应该将 edge[cnt++].v = v;
改为 edge[++cnt].v = v;
by dongzirui0817 @ 2024-10-03 21:37:42
可以好好复习一下 ++cnt
与 cnt++
的区别
by Algo_3F @ 2024-10-03 21:41:20
@Light_LE 经典