B - TT 的旅行日记

题意介绍

甲乙两地之间有两种线路：经济线和商业线，从甲地到乙地可以坐一站商业线，问时间耗费最小的乘坐方法。

#题意分析
从甲地开始做一遍迪杰斯特拉，记录下在不乘坐商业线的情况下各站点到甲地的最短路径以及前驱节点，从乙地开始做一遍同样的操作，然后枚举各商业站(u,v,w)，获得min{dis1[u]+dis2[v]+w, dis1[v]+dis2[u]+w，dis1[乙]}。在输出从起点到终点经过的站点时，需要用遍历记录前驱节点的数组并用一个新的数组存放遍历得到的元素，输出时要注意前后顺序。

通过代码

#include<iostream>
#include<queue>
#include<algorithm>
#include<string.h>
using namespace std;

const int inf = 0x3f3f3f3f;
int n, s, e, m, k;
priority_queue<pair<int, int>> q;
bool vis[10010];
int path[10010];
int dis1[10010], dis2[10010];
int fre1[10010], fre2[10010];

struct edge {
	int to, next, w;
}edge[10010];

int head[10010], tot;
void init() {
	tot = 0;
	//for (int i = 0; i < n; i++)head[i] = -1;
	memset(head, -1, sizeof(head));
}
void add(int x, int y, int w) {
	edge[tot].to = y;
	edge[tot].next = head[x];
	edge[tot].w = w;
	head[x] = tot;
	tot++;
}





void dijkstra(int s,int *dis,int *fre) {
	while (q.size()) q.pop();
	memset(vis, false, sizeof(vis));
	for (int i = 1; i <= n; i++) {
		dis[i] = inf;
	}
	fre[s] = -1;
	dis[s] = 0;
	q.push(make_pair(0, s));
	while (!q.empty()) {
		int x = q.top().second;
		q.pop();
		if (vis[x])continue;
		vis[x] = 1;
		for (int i = head[x]; i!=-1; i = edge[i].next) {
			int y = edge[i].to, w = edge[i].w;
			if (dis[y] > dis[x] + w) {
				dis[y] = dis[x] + w;
				fre[y] = x;
				q.push(make_pair(-dis[y], y));
			}
		}
	}
}


int main() {
	int item = 0;
	ios::sync_with_stdio(false);
	while (cin >> n >> s >> e) {
		if (item) cout << endl;
		cin >> m;
		tot = 0;
		int a, b, c;
		init();
		while (m--) {
			cin >> a >> b >> c;
			add(a, b, c);
			add(b, a, c);
		}

		dijkstra(s, dis1, fre1);
		dijkstra(e, dis2, fre2);

		int u, v, w;
		cin >> k;
		int ans = dis1[e], minu, minv, flag = 0;
		for (int i = 0; i < k; i++) {
			cin >> u >> v >> w;
			if (dis1[u] + dis2[v] + w < ans) {
				ans = dis1[u] + dis2[v] + w;
				minu = u;
				minv = v;
				flag = 1;
			}
			if (dis1[v] + dis2[u] + w < ans) {
				ans = dis1[v] + dis2[u] + w;
				minu = v;
				minv = u;
				flag = 1;
			}
		}
		if (flag == 1) {
			int cnt = 0;
			int temp = minu;
			path[cnt++] = temp;
			while (fre1[temp] != -1) {
				path[cnt++] = fre1[temp];
				temp = fre1[temp];
			}
			for (int i = cnt - 1; i >= 0; i--) cout << path[i] << " ";
			cnt = 0;
			temp = minv;
			path[cnt++] = temp;
			while (fre2[temp] != -1) {
				path[cnt++] = fre2[temp];
				temp = fre2[temp];
			}
			for (int i = 0; i < cnt - 1; i++) cout << path[i] << " ";
			cout << path[cnt - 1] << endl;
			cout << minu << endl;
		}
		else {
			int cnt = 0;
			int temp = e;
			path[cnt++] = temp;
			while (fre1[temp] != -1) {
				path[cnt++] = fre1[temp];
				temp = fre1[temp];
			}
			for (int i = cnt - 1; i > 0; i--)cout << path[i] << " ";
			cout << path[0] << endl;
			cout << "Ticket Not Used" << endl;
		}
		cout << ans << endl;
		item++;
	}
	
	return 0;
}