时间限制
5000 ms
内存限制
64 MB
题解 :
- 首先是多源最短路,求出分别以所有点为起始分别到所有点为结尾的最短路,因此用floyd,且是以w1为值且需要w1越小越好,因此,输入时,需要e数组中存下边的长度,然后经典floyd三层循环;需要注意的是e的初始化!!!
- 然后是单源最短路堆优化版dijkstra,以上一步中求得的rt为起始点,有两个权值,需要第一权值越小越好,第二权值越大越好,需要使用到结构体,其中pq存的是
点
,点的结构体是“点、权值1、权值2”,并用dist和dist2数组分别记录单源最短路中最小权值1结果和最大权值2结果;还需要一个vector用来存图上的所有边,再定义另外的一个结构体,其中存的是边
,边的结构体是“边的终点、权值1、权值2”;由于权值1越小越好,因此要将权值1初始话为无穷大,权值2越大越好,因此初始化为0即可 - 要打印路径,因此将pre数组初始化为-1
#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
const int N = 1e3 + 10;
const int inf = 1e9 + 10;
struct edge {
int to, w1, w2;
};
struct node {
int u, w1, w2;
};
int n, m;
int e[N][N];
vector<edge> G[N];
int dist[N], dist2[N];
int pre[N];
bool st[N];
struct cmp {
bool operator() (node a, node b) {
if (a.w1 != b.w1) return a.w1 > b.w1;
return a.w2 < b.w2;
}
};
void print(int x) {
if (pre[x] == -1) return ;
print(pre[x]);
cout << "->" << x;
}
int main() {
cin >> n >> m;
memset(e, 0x3f, sizeof e);
for (int i = 0; i < m; ++ i) {
int u, v, w1, w2;
cin >> u >> v >> w1 >> w2;
e[u][v] = e[v][u] = w1;
G[u].push_back({v, w1, w2});
G[v].push_back({u, w1, w2});
}
for (int k = 1; k <= n; ++ k) {
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= n; ++ j) {
e[i][j] = min(e[i][j], e[i][k] + e[k][j]);
}
}
}
int mi = inf, rt;
for (int i = 1; i <= n; ++ i) {
int tmp = 0;
for (int j = 1; j <= n; ++ j) {
tmp = max(tmp, e[i][j]);
}
if (tmp < mi) {
mi = tmp;
rt = i;
}
}
for (int i = 1; i <= n; ++ i) {
dist[i] = inf;
pre[i] = -1;
}
priority_queue<node, vector<node>, cmp> pq;
pq.push({rt, 0, 0});
dist[rt] = dist2[rt] = 0;
while (pq.size()) {
int u = pq.top().u; pq.pop();
if (st[u]) continue;
st[u] = true;
for (auto ne : G[u]) {
int v = ne.to;
if (dist[v] > dist[u] + ne.w1) {
dist[v] = dist[u] + ne.w1;
dist2[v] = dist2[u] + ne.w2;
pre[v] = u;
pq.push({v, dist[v], dist2[v]});
} else if (dist[v] == dist[u] + ne.w1 && dist2[v] < dist2[u] + ne.w2) {
dist2[v] = dist2[u] + ne.w2;
pre[v] = u;
pq.push({v, dist[v], dist2[v]});
}
}
}
cout << rt << endl;
int _; cin >> _;
while (_ -- ) {
int x;
cin >> x;
cout << rt;
print(x);
cout << endl << dist[x] << ' ' << dist2[x] << endl;
}
}