PAT甲级1111 【Online Map】 (30)

补充：2018.8.25更新，写这种题一定要静心，否则小bug会不经意间不断出现，再写一遍代码行居然和上次一样，不过方法略有差别。

#include<iostream>
#include<cstdio>
#include<vector> 
#include<cstring>
using namespace std;
const int maxn = 510;
const int inf = 0x3f3f3f3f;
int n, m, st, ed, mind = inf, minT = inf, mincnt = inf;
int length[maxn][maxn], cost[maxn][maxn], vis[maxn], preD[maxn], preT[maxn];
vector<int> e[maxn], temD[maxn], temT[maxn], pathD, pathT, tempath;
void dijkstraD(){
	int dis[maxn], t[maxn];
	memset(dis, inf, sizeof dis);
	memset(t, inf, sizeof t);
	memset(vis, 0, sizeof vis);
	dis[st] = 0;
	t[st] = 0;
	for(int i = 0; i<n; i++){
		int u = -1, minn = inf;
		for(int j = 0; j<n; j++){
			if(!vis[j] && dis[j] < minn){
				minn = dis[u = j];
			}
		}
		if(u == -1) break;
		vis[u] = 1;
		for(int v = 0; v<n; v++){
			if(length[u][v] == inf) continue;
			if(dis[v] > dis[u] + length[u][v]){
				dis[v] = dis[u]+length[u][v];
				t[v] = t[u]+cost[u][v];
				preD[v] = u;
			} else if(dis[v] == dis[u]+length[u][v]){
				if(t[v] > t[u]+cost[u][v]){
					t[v] = t[u]+cost[u][v];
					preD[v] = u;
				}
			}
		}
	}
	mind = dis[ed];
}
void dijkstraT(){
	int t[maxn];
	memset(t, inf, sizeof t);
	memset(vis, 0, sizeof vis);
	t[st] = 0;
	for(int i = 0; i<n; i++){
		int u = -1, minn = inf;
		for(int j = 0; j<n; j++){
			if(!vis[j] && minn > t[j]){
				minn = t[u = j];
			}
		}
		if(u == -1) break;
		vis[u] = 1;
		for(int v = 0; v<n; v++){
			if(t[v] > t[u]+cost[u][v]){
				t[v] = t[u]+cost[u][v];
			} 
		}
	}
	minT = t[ed];
}
void dfs(int u){
	if(u == st) return;
	dfs(preD[u]);
	pathD.push_back(u);
}
void dfsT(int u, int cnt, int curT){
	if(curT > minT) return ;
	if(curT == minT && u == ed){
		if(mincnt > cnt){
			mincnt = cnt;
			pathT = tempath;
		}
	}
	for(int i = 0; i<e[u].size(); i++){
		int v = e[u][i];
		if(!vis[v]){
			vis[v] = 1;
			tempath.push_back(v);
			dfsT(v, cnt+1, curT+cost[u][v]);
			tempath.pop_back();
			vis[v] = 0;
		}
	}
}
void printPath(vector<int> vec){
	for(int i = 0; i<vec.size(); i++){
		cout << vec[i];
		i!=vec.size()-1 ? cout << " -> " : cout << '\n'; 
	}
}
int main(){
	//freopen("aa.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin >> n >> m;
	int u, v, oneway;
	memset(length, inf, sizeof length);
	memset(cost, inf, sizeof cost);
	for(int i = 0; i<m; i++){
		cin >> u >> v >> oneway ;
		cin >> length[u][v] >> cost[u][v]; //不能一次性cin，因为u、v未知。。 
		e[u].push_back(v);
		if(!oneway){
			e[v].push_back(u);
			length[v][u] = length[u][v], cost[v][u] = cost[u][v];
		}
	} 
	cin >> st >> ed;
	dijkstraD();
	pathD.push_back(st); 
	dfs(ed);
	dijkstraT();
	memset(vis, 0, sizeof vis);
	tempath.push_back(st);
	dfsT(st, 0, 0);
	if(pathD == pathT){
		cout << "Distance = " << mind << "; Time = " << minT << ": ";
		printPath(pathD);
	} else {
		cout << "Distance = " << mind << ": ";
		printPath(pathD);
		cout << "Time = " << minT << ": ";
		printPath(pathT);
	}
	return 0;
} 

分析：dijkstra+dfs，dijkstra确定最短路径距离，dfs爆搜最短路径，注意剪枝，初始化无穷大，vector数组可以直接判等等。一开始只用了dfs爆搜最后一个测试点过不去。。

#include<stdio.h>
#include<vector>
#include<string.h>
using namespace std;

const int inf = 0x3f3f3f3f;
typedef struct Street{
	vector<int> adj, len, time;
}Street;
Street street[550];
int vis[550];
int d1 = inf, t1 = inf,t2 = inf, cnt2 = inf, st, ed, n;
vector<int> resD, resT, tempath, tempath2;
int G[550][550], T[550][550];

void init(int u, int v, int len, int time){
	G[u][v] = len;
	T[u][v] = time;
	street[u].adj.push_back(v);
	street[u].len.push_back(len);
	street[u].time.push_back(time);
}

int dijstra(int arr[][550]) { //传二维数组低维大小要传入 
	int d[550];
	memset(vis, 0, sizeof vis);  
	//fill(d, d+n, inf);
	memset(d, inf, sizeof d);  //memset或者fill都可以初始化最大值 
	d[st] = 0;
	while(true){
		int u = -1, minn = inf;
		for(int i = 0; i<n; i++){
			if(!vis[i] && minn > d[i]){
				u = i;
				minn = d[i];
			}
		}
		if(u == -1 || u == ed) break;
		vis[u] = 1;
		for(int v = 0; v<n; v++){
			if(!vis[v] && d[v] > d[u]+arr[u][v])
				d[v] = d[u]+arr[u][v];	
		}
	}
	return d[ed];
}
void dfspathD(int cur, int sum, int time){
	if(sum > d1) return; //当前距离已经大于最短路径就没必要继续搜索 
	if(cur == ed){
		if(sum == d1 && time < t1) {
				t1 = time;
				resD = tempath;
		}
		return;
	}
	tempath.push_back(cur); //将当前结点加入到路径中 
	for(int i = 0; i<street[cur].adj.size(); i++){
		int adj = street[cur].adj[i];
		if(!vis[adj]){
			vis[adj] = 1;
			dfspathD(adj, sum+street[cur].len[i], time+street[cur].time[i]);
			vis[adj] = 0; 
		}
	}
	tempath.pop_back(); //释放当前结点 
}
void dfspathT(int cur, int sum, int time, int cnt){
	if(time > t2) return ; //当前所用时间已经大于最短时间就没必要继续搜索 
	if(cur == ed){
		if(time == t2 && cnt < cnt2){
				resT = tempath2;
				cnt2 = cnt;
		}
		return;
	}
	tempath2.push_back(cur); //将当前结点加入到路径中 
	for(int i = 0; i<street[cur].adj.size(); i++){
		int adj = street[cur].adj[i];
		if(!vis[adj]){
			vis[adj] = 1;
			dfspathT(adj, sum+street[cur].len[i], time+street[cur].time[i], cnt+1);
			vis[adj] = 0; 
		}
	}
	tempath2.pop_back(); //释放当前结点 
}
void initDfs(int st){
	memset(vis, 0, sizeof vis);
	vis[st] = 1;
}
int main(){
//	freopen("in.txt", "r", stdin);
	int i, m, u, v, single, len, time;
//	fill(G[0], G[0]+550*550, inf);
//	fill(T[0], T[0]+550*550, inf);
	memset(G, inf, sizeof G);
	memset(T, inf, sizeof T);
	scanf("%d %d", &n, &m);
	for(i = 0; i<m; i++){
		scanf("%d %d %d %d %d", &u, &v, &single, &len, &time);
		init(u, v, len, time);
		if(single != 1) init(v, u, len, time); //双向边 
	}
	scanf("%d %d", &st, &ed);
	d1 = dijstra(G);
	t2 = dijstra(T);

	initDfs(st);
	dfspathD(st, 0, 0); //爆搜 路径1 
	initDfs(st);
	dfspathT(st, 0, 0, 0);  //爆搜 路径2 
	if(resT == resD){
		printf("Distance = %d; Time = %d: ", d1, t2);
		for(i = 0; i<resD.size(); i++)
			printf("%d -> ", resD[i]);
		printf("%d\n", ed);
	}
	else {
		printf("Distance = %d: ", d1);
		for(i = 0; i<resD.size(); i++)
			printf("%d -> ", resD[i]);
		printf("%d\n", ed);
		printf("Time = %d: ", t2);
		for(i = 0; i<resT.size(); i++)
			printf("%d -> ", resT[i]);
		printf("%d\n", ed);
	}
	return 0;
}