PAT甲级 1111 Online Map（最短路径的应用）

题目链接：点击打开链接

思路：写的比较繁琐，利用dijkstra算法分别去求最短路径和最快路径，再按照要求输出即可。还写了一个搜索的版本，由于剪枝函数不够优化，复杂度过高，最后一个测试点超时，27分。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define M 250010
#define INF 0x3f3f3f3f
int cnt,head[505];
int v[M],nex[M],dis[M],times[M];
int ans1,ans2;
vector<int> re1,re2;
struct node1{
	int to,dis,times;
	node1(int a,int b,int c):to(a),dis(b),times(c){}
	bool operator<(const node1& a)const{
		if(dis != a.dis) return dis > a.dis;
		else return times > a.times;
	}
};
struct node2{
	int to,times,sec;
	node2(int a,int b,int c):to(a),times(b),sec(c){}
	bool operator<(const node2& a)const{
		if(times != a.times) return times > a.times;
		else return sec > a.sec;
	}
};
void add(int x,int y,int di,int tim){
	cnt++;
	v[cnt] = y;
	dis[cnt] = di;
	times[cnt] = tim;
	nex[cnt] = head[x];
	head[x] = cnt;
}
void dijkstra1(int x,int y){
	priority_queue<node1> q;
	int pre[505],cost[505],ti[505];
	memset(cost,INF,sizeof(cost));
	memset(ti,INF,sizeof(ti));
	q.push(node1(x,0,0));
	pre[x] = -1;
	cost[x] = 0;
	ti[x] = 0;
	while(!q.empty()){
		node1 te = q.top();
		q.pop();
		for(int i = head[te.to];i;i = nex[i]){
			if(cost[v[i]] == INF || cost[v[i]] > te.dis + dis[i]){
				pre[v[i]] = te.to;
				cost[v[i]] = te.dis + dis[i];
				ti[v[i]] = te.times + times[i];
				q.push(node1(v[i],cost[v[i]],ti[v[i]]));
			}
			else if(cost[v[i]] == te.dis + dis[i] && ti[v[i]] > te.times + times[i]){
				pre[v[i]] = te.to;
				ti[v[i]] = te.times + times[i];
				q.push(node1(v[i],cost[v[i]],ti[v[i]]));
			}
		} 
	}
	ans1 = cost[y];
	int now = y;
	while(now != -1){
		re1.push_back(now);
		now = pre[now];
	}
	return; 
}
void dijkstra2(int x,int y){
	priority_queue<node2> q;
	int pre[505],ti[505],trans[505];
	memset(ti,INF,sizeof(ti));
	memset(trans,INF,sizeof(trans));
	q.push(node2(x,0,0));
	pre[x] = -1;
	ti[x] = 0;
	trans[x] = 0;
	while(!q.empty()){
		node2 te = q.top();
		q.pop();
		for(int i = head[te.to];i;i = nex[i]){
			if(ti[v[i]] == INF || ti[v[i]] > te.times + times[i]){
				pre[v[i]] = te.to;
				ti[v[i]] = te.times + times[i];
				trans[v[i]] = te.sec + 1;
				q.push(node2(v[i],ti[v[i]],trans[v[i]]));
			}
			else if(ti[v[i]] == te.times + times[i] && trans[v[i]] > te.sec + 1){
				pre[v[i]] = te.to;
				trans[v[i]]= te.sec + 1;
				q.push(node2(v[i],ti[v[i]],trans[v[i]]));
			}
		} 
	}
	ans2 = ti[y];
	int now = y;
	while(now != -1){
		re2.push_back(now);
		now = pre[now];
	}
	return;
}
int main(){
	int n,m;
	int x,y,flag,dis,times;
	scanf("%d%d",&n,&m);
	cnt = 0;
	memset(head,0,sizeof(head));
	for(int i = 1;i <= m;i++){
		scanf("%d%d%d%d%d",&x,&y,&flag,&dis,×);
		add(x,y,dis,times);
		if(!flag) add(y,x,dis,times);
	}
	scanf("%d%d",&x,&y);
	dijkstra1(x,y);
	dijkstra2(x,y);
	flag = 1;
	if(re1.size() != re2.size()) flag = 0;
	if(re1.size() == re2.size()){
		for(int i = 0;i < re1.size();i++){
			if(re1[i] != re2[i]){
				flag = 0;
				break;
			} 
		}
	}
	if(!flag){
		printf("Distance = %d: %d",ans1,x);
		for(int i = re1.size() - 2;i >= 0;i--){
			printf(" -> %d",re1[i]);
		}
		putchar('\n');
		printf("Time = %d: %d",ans2,x);
		for(int i = re2.size() - 2;i >= 0;i--){
			printf(" -> %d",re2[i]);
		}
		putchar('\n');
	}
	else{
		printf("Distance = %d; Time = %d: %d",ans1,ans2,x);
		for(int i = re1.size() - 2;i >= 0;i--){
			printf(" -> %d",re1[i]);
		}
		putchar('\n');
	}
	return 0;
}

下面为未AC的搜索版本：

#include <cstdio>
#include <cstring>
#include <iostream>
#define MAX 0x7FFFFFFF
using namespace std;
int map[500][500],times[500][500],length[505][505];
int shortPath[505],quickPath[505],tempPath[505];
int book[505];
int minPath=MAX,minTime=MAX;
int minPathTime,minTimeNode;
int n,m;
int start,des;
int top1,top2;
void dfs(int x,int step,int len,int cost){
	if(len>minPath&&cost>minTime){
		return;
	}
	if(x==des){
		if(len<minPath||(len==minPath&&cost<minPathTime)){
			for(int i=0;i<step;i++){
				shortPath[i]=tempPath[i];
			}
			minPathTime=cost;
			top1=step-1;
		}
		minPath=minPath>len?len:minPath;
		if(cost<minTime||(cost==minTime&&minTimeNode>step)){
			for(int i=0;i<step;i++){
				quickPath[i]=tempPath[i];
			}
			minTimeNode=step;
			top2=step-1;
		}
		minTime=minTime>cost?cost:minTime;
		return;
	}
	for(int i=0;i<n;i++){
		if(map[x][i]&&!book[i]){
			book[i]=1;
			tempPath[step]=i;
			dfs(i,step+1,len+length[x][i],cost+times[x][i]);
			book[i]=0;
		}
	}
}
void Print(int a[],int n){
	cout<<' '<<a[0];
	for(int i=1;i<=n;i++){
		printf(" -> %d",a[i]);
	}
	cout<<endl;
	return;
}
int main(){
	int i,x,y,flag,len,cost;
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++){
		scanf("%d%d%d%d%d",&x,&y,&flag,&len,&cost);
		map[x][y]=1;
		length[x][y]=len;
		times[x][y]=cost;
		if(!flag){
			map[y][x]=1;
			length[y][x]=len;
			times[y][x]=cost;
		}
	}
	scanf("%d%d",&start,&des);
	tempPath[0]=start;
	book[start]=1;
	dfs(start,1,0,0);
	for(i=0;i<=top1;i++){
		if(shortPath[i]!=quickPath[i]){
			break;
		}
	}
	if(top1==top2&&i==top1+1){
		printf("Distance = %d;",minPath);
		printf(" Time = %d:",minTime);
		Print(quickPath,top2);
	}
	else{
		printf("Distance = %d:",minPath);
		Print(shortPath,top1);
		printf("Time = %d:",minTime);
		Print(quickPath,top2);
	}
	return 0;
}