P1629 邮递员送信 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
题目描述
有一个邮递员要送东西,邮局在节点 1。他总共要送 n−1 样东西,其目的地分别是节点 2 到节点 n。由于这个城市的交通比较繁忙,因此所有的道路都是单行的,共有 m 条道路。这个邮递员每次只能带一样东西,并且运送每件物品过后必须返回邮局。求送完这 n−1 样东西并且最终回到邮局最少需要的时间。
思路:
正向跑完dijkstra 后要加上重新回到1号点的距离,但是不能对每个点都跑一边dijkstra 这样时间复杂度会超,可以反向建图,跑一边dijkstra即可求出每个点到1号点的最短距离
#include <bits/stdc++.h>
#define dbg(x) cout << #x << '=' << x << endl
#define FA ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
using namespace std;
const int N = 1e3 + 10, M = 1e3 + 10, mod = 1e9 + 7;
const double eps = 1e-8;
typedef long long LL;
typedef pair<int, int> PII;
int n, m;
int g[N][N], gg[N][N];
int dist[N];
bool st[N];
void solve() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j) {
g[i][j] = 0;
gg[i][j] == 0;
} else {
g[i][j] = INF;
gg[i][j] = INF;
}
}
}
for (int i = 0; i < m; i++) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
g[a][b] = min(g[a][b], c);
gg[b][a] = min(gg[b][a], c);//反向图
}
int sum = 0;
//正向
memset(dist, INF, sizeof dist);
memset(st, 0, sizeof st);
dist[1] = 0;
for (int i = 0; i < n; i++) {
int t = -1;
for (int j = 1; j <= n; j++) {
if (!st[j] && (t == -1 || dist[t] > dist[j])) t = j;
}
st[t] = 1;
for (int j = 1; j <= n; j++) {
dist[j] = min(dist[j], dist[t] + g[t][j]);
}
}
for (int i = 2; i <= n; i++) {
sum += dist[i];
}
//反向
memset(dist, INF, sizeof dist);
memset(st, 0, sizeof st);
dist[1] = 0;
for (int i = 0; i < n; i++) {
int t = -1;
for (int j = 1; j <= n; j++) {
if (!st[j] && (t == -1 || dist[t] > dist[j])) t = j;
}
st[t] = 1;
for (int j = 1; j <= n; j++) {
dist[j] = min(dist[j], dist[t] + gg[t][j]);//注意gg
}
}
for (int i = 2; i <= n; i++) {
sum += dist[i];
}
printf("%d\n", sum);
}
signed main() {
int T = 1;
// FA;
while (T--) {
solve();
}
}