PAT (Advanced Level) 1111 Online Map——最短路 ( Dijkstra+dfs ) * 2

题目传送门

题目不难，就是麻烦
我一开始想只写一个dijkstra和dfs就解决两个最短路问题
结果是又复杂又bug
最后拆分成了两个dijkstra+dfs才A掉

Tip

根据实际情况，决定是否复用函数
这道题很显然就是个杂烩题，对于任何一种最短路，我们已经有了很完备的算法
这种情况下就不要破坏经验得到的完备解法
之前遇到的神仙模拟题，本身没有完备解法，且结构有极高的相似性，所以可以使用集成度较高的解法

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;

const int N = 505;
const int INF = 0x33333333;
struct node {
	int y;
	int c[2];
	int nxt;
};
node way[N * N];
int st[N], tot = -1;
int n, m;

void addway(int u,int v,int w1,int w2) {
	tot++;
	way[tot].y = v;
	way[tot].c[0] = w1;  //length
	way[tot].c[1] = w2;  //time
	way[tot].nxt = st[u];
	st[u] = tot;
}

int s, t;
int path[N], dis[N], mn_length, mn_time;
int ans_path[N][2], ans_cnt[2], addition;
int vis[N];

void dijkstra_length() {
	for (int i = 0; i < n; ++i) vis[i] = 0;
	for (int i = 0; i < n; ++i) dis[i] = INF;
	dis[s] = 0;
	while(1) {
		int mn = INF;
		int index = -1;
		for (int i = 0; i < n; ++i) {
			if (dis[i] < mn && !vis[i]) {
				mn = dis[i];
				index = i;
			}
		}
		if (index == t || index == -1) break;
		vis[index] = 1;
		for (int i = st[index]; i != -1; i = way[i].nxt) {
			dis[way[i].y] = min(dis[way[i].y], dis[index] + way[i].c[0]);
		}
	}
	mn_length = dis[t];
}

void dijkstra_time() {
	for (int i = 0; i < n; ++i) vis[i] = 0;
	for (int i = 0; i < n; ++i) dis[i] = INF;
	dis[s] = 0;
	while (1) {
		int mn = INF;
		int index = -1;
		for (int i = 0; i < n; ++i) {
			if (dis[i] < mn && !vis[i]) {
				mn = dis[i];
				index = i;
			}
		}
		if (index == t || index == -1) break;
		vis[index] = 1;
		for (int i = st[index]; i != -1; i = way[i].nxt) {
			dis[way[i].y] = min(dis[way[i].y], dis[index] + way[i].c[1]);
		}
	}
	mn_time = dis[t];
}

void dfs_length(int nw, int co1, int co2, int cnt) {
	if (co1 > mn_length || (co1 == mn_length && nw != t)) return;
	if (co1 == mn_length && nw == t) {
		if (co2 < addition) {
			ans_cnt[0] = cnt;
			addition = co2;  //fastest
			for (int i = 1; i <= cnt; ++i)
				ans_path[i][0] = path[i];
		}
		return;
	}
	for (int i = st[nw]; i != -1; i = way[i].nxt) {
		int y = way[i].y;
		if (!vis[y]) {
			vis[y] = 1;
			path[cnt + 1] = y;
			dfs_length(y, co1 + way[i].c[0], co2 + way[i].c[1], cnt + 1);
			vis[y] = 0;
		}
	}
}

void dfs_time(int nw,int co,int cnt) {
	if (co > mn_time || (co == mn_time && nw != t)) return;
	if (co == mn_time && nw == t) {
		if (cnt < ans_cnt[1]) {  //fewer intersections
			ans_cnt[1] = cnt;
			for (int i = 1; i <= cnt; ++i)
				ans_path[i][1] = path[i];
		}
		return;
	}
	for (int i = st[nw]; i != -1; i = way[i].nxt) {
		int y = way[i].y;
		if (!vis[y]) {
			vis[y] = 1;
			path[cnt + 1] = y;
			dfs_time(y, co + way[i].c[1], cnt + 1);
			vis[y] = 0;
		}
	}
}

int equal() {
	if (ans_cnt[0] != ans_cnt[1]) return 0;
	for (int i = 1; i <= ans_cnt[0]; ++i)
		if (ans_path[i][0] != ans_path[i][1]) return 0;
	return 1;
}

int main()
{
	scanf("%d%d",&n,&m);
	for (int i = 0; i < n; ++i) st[i] = -1;
	for (int i = 1; i <= m; ++i) {
		int u, v, opt, w1, w2;
		scanf("%d%d%d%d%d", &u, &v, &opt, &w1, &w2);
		addway(u, v, w1, w2);
		if (!opt) addway(v, u, w1, w2);
	}
	scanf("%d%d", &s, &t);

	dijkstra_length();
	for (int i = 0; i < n; ++i) vis[i] = 0;
	vis[s] = 1;
	addition = INF;  //shortest
	dfs_length(s, 0, 0, 0);

	dijkstra_time();
	for (int i = 0; i < n; ++i) vis[i] = 0;
	vis[s] = 1;
	ans_cnt[1] = INF;  //fewest intersections
	dfs_time(s, 0, 0);

	if (equal()) {
		printf("Distance = %d; Time = %d: %d", mn_length, mn_time, s);
		for (int i = 1; i <= ans_cnt[0]; i++) 
			printf(" -> %d",ans_path[i][0]);
	}
	else {
		printf("Distance = %d: %d", mn_length, s);
		for (int i = 1; i <= ans_cnt[0]; i++) 
			printf(" -> %d", ans_path[i][0]);
		printf("\nTime = %d: %d", mn_time, s);
		for (int i = 1; i <= ans_cnt[1]; i++) 
			printf(" -> %d", ans_path[i][1]);
	}
	return 0;
}