PAT A1111(测试点2，4答案错误)

很好，又死在了题意的理解上
where V1 and V2 are the indices (from 0 to N−1) of the two ends of the street; one-way is 1 if the street is one-way from V1 to V2, or 0 if not.
我是这么理解的，如果one-way为1表示从v1到v2只有一条路，否则有多条路(通过其他结点到达)
其实这句话是无向和有向边的意思
哎，可能英文是阻碍我学习的主要障碍吧

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

const int maxn = 510;
const int INF = 1 << 31 - 1;
int n, m, st, dest, sum = 0;
int dis[maxn][maxn], time1[maxn][maxn];
int d[maxn];
bool vis[maxn] = { false }, num[maxn] = {false};
vector<int> tempPath, pre[maxn], result1, result2;
vector<vector<int>> path;
void Dijkstra(int st, int G[][maxn]) {
	fill(d, d + maxn, INF);
	fill(vis, vis + maxn, false);
	d[st] = 0;
	for(int i = 0; i < n; i++) {
		int u = -1, MIN = INF;
		for(int j = 0; j < n; j++) {
			if(vis[j] == false && d[j] < MIN) {
				u = j;
				MIN = d[j];
			}
		}
		if(u == -1) return ;
		vis[u] = true;
		for(int v = 0; v < n; v++) {
			if(vis[v] == false && G[u][v] != INF && d[u] + G[u][v] < d[v]) {
				d[v] = d[u] + G[u][v];
				pre[v].clear(); 
				pre[v].push_back(u);
			}
		}
	}
	return ;
}
void DFS(int dest) {
	if(dest == st) {
		tempPath.push_back(dest);
		path.push_back(tempPath);
		tempPath.pop_back();
		return ;
	}
	tempPath.push_back(dest);
	for(int i = 0; i < pre[dest].size(); i++) DFS(pre[dest][i]);
	tempPath.pop_back();
}

void print(vector<int> a) {
	for(int i = a.size() - 1; i >= 0;i--) {
		cout << a[i];
 		if(i) cout << " -> ";
	}
}

int main() {
	fill(dis[0], dis[0] + maxn * maxn, INF);
	fill(time1[0], time1[0] + maxn * maxn, INF);
	cin >> n >> m;
	for(int i = 0; i < m; i++) {
		int a, b, one, len, t;
		cin >> a >> b >> one >> len >> t;
		dis[a][b] = dis[b][a] = len;
		time1[a][b] = time1[b][a] = t;
	}
 	cin >> st >> dest;
 	Dijkstra(st, dis);
 	DFS(dest);
	int a = d[dest], b;
	if(path.size() == 1) {
		result1 = path[0];
	} else {
		int minTime = INF, t;
		for(int i = 0; i < path.size(); i++) {
            t = 0;
			for(int j = path[i].size() - 1; j > 0; j--) {
				int a = path[i][j], b = path[i][j - 1];
				t += time1[a][b];
			}
			if(t < minTime) {
				minTime = t;
				result1 = path[i];
			}
		}
	}
	path.clear();
	for(int i = 0; i <= n; i++) pre[i].clear();
	Dijkstra(st, time1);
	DFS(dest);
	b = d[dest];
	if(path.size() == 1) {
		result2 = path[0];
	} else {
		int minInter = 510, ans;
		for(int i = 0; i < path.size(); i++) {
			ans = 0;
            fill(num, num + n, false);
			for(int j = path[i].size() - 1; j >= 0; j--) {
				int a = path[i][j];
				num[a] = true;
			}
			for(int i = 0; i < n; i++) if(num[i]) ans ++;
			if(ans < minInter) {
				minInter = ans;
				result2 = path[i];
			}
		}
	}
	if(result1 == result2) {
		cout << "Distance = " << a << "; Time = " << b << ": ";
		print(result1);
	} else {
		cout << "Distance = " << a << ": ";
		print(result1);
		cout << endl;
		cout << "Time = " << b << ": ";
		print(result2);
	}
	return 0;
}

修改上述对题意的理解后，测试点2，4还是答案错误

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

const int maxn = 510;
const int INF = 1 << 31 - 1;
int n, m, st, dest, sum = 0;
int dis[maxn][maxn], time1[maxn][maxn];
int d[maxn];
bool vis[maxn] = { false }, num[maxn] = {false};
vector<int> tempPath, pre[maxn], result1, result2;
vector<vector<int>> path;
void Dijkstra(int st, int G[][maxn]) {
	fill(d, d + maxn, INF);
	fill(vis, vis + maxn, false);
	d[st] = 0;
	for(int i = 0; i < n; i++) {
		int u = -1, MIN = INF;
		for(int j = 0; j < n; j++) {
			if(vis[j] == false && d[j] < MIN) {
				u = j;
				MIN = d[j];
			}
		}
		if(u == -1) return ;
		vis[u] = true;
		for(int v = 0; v < n; v++) {
			if(vis[v] == false && G[u][v] != INF && d[u] + G[u][v] < d[v]) {
				d[v] = d[u] + G[u][v];
				pre[v].clear(); 
				pre[v].push_back(u);
			}
		}
	}
	return ;
}
void DFS(int dest) {
	if(dest == st) {
		tempPath.push_back(dest);
		path.push_back(tempPath);
		tempPath.pop_back();
		return ;
	}
	tempPath.push_back(dest);
	for(int i = 0; i < pre[dest].size(); i++) DFS(pre[dest][i]);
	tempPath.pop_back();
}

void print(vector<int> a) {
	for(int i = a.size() - 1; i >= 0;i--) {
		cout << a[i];
 		if(i) cout << " -> ";
	}
}

int main() {
	fill(dis[0], dis[0] + maxn * maxn, INF);
	fill(time1[0], time1[0] + maxn * maxn, INF);
	cin >> n >> m;
	for(int i = 0; i < m; i++) {
		int a, b, one, len, t;
		cin >> a >> b >> one >> len >> t;
		dis[a][b] = len; // --------------------------------
		time1[a][b] = t;
		if(one != 1) {
			dis[b][a] = len;
			time1[b][a] = t;
		}      //      对以上几行代码进行了修改
	}
 	cin >> st >> dest;
 	Dijkstra(st, dis);
 	DFS(dest);
	int a = d[dest], b;
	if(path.size() == 1) {
		result1 = path[0];
	} else {
		int minTime = INF, t;
		for(int i = 0; i < path.size(); i++) {
            t = 0;
			for(int j = path[i].size() - 1; j > 0; j--) {
				int a = path[i][j], b = path[i][j - 1];
				t += time1[a][b];
			}
			if(t < minTime) {
				minTime = t;
				result1 = path[i];
			}
		}
	}
	path.clear();
	for(int i = 0; i <= n; i++) pre[i].clear();
	Dijkstra(st, time1);
	DFS(dest);
	b = d[dest];
	if(path.size() == 1) {
		result2 = path[0];
	} else {
		int minInter = n + 1, ans;
		for(int i = 0; i < path.size(); i++) {
			ans = 0;
            fill(num, num + n, false);
			for(int j = path[i].size() - 1; j >= 0; j--) {
				int a = path[i][j];
				num[a] = true;
			}
			for(int i = 0; i < n; i++) if(num[i]) ans ++;
			if(ans < minInter) {
				minInter = ans;
				result2 = path[i];
			}
		}
	}
	if(result1 == result2) {
		cout << "Distance = " << a << "; Time = " << b << ": ";
		print(result1);
	} else {
		cout << "Distance = " << a << ": ";
		print(result1);
		cout << endl;
		cout << "Time = " << b << ": ";
		print(result2);
	}
	return 0;
}