题意:最短时间的路若相同取最短距离,最短距离若相同取最小途径数。
我一开始看成了最短时间求最小距离,最小距离求最短时间,疯狂WA,然后有500个点,并且边也非常多。
题解:dijkstra变形,和直捣黄龙,紧急救援差不多。
代码:
#include <iostream>
#include<queue>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 4005;
const int inf = 0x3f3f3f3f;
int mp_dis[maxn][maxn],mp_time[maxn][maxn];
struct node{
int t,d;
}tim[maxn],dis[maxn];
int pre_dis[maxn],pre_time[maxn];
bool vis[maxn];
void dijk_dispri(int st,int n){
int i,j;
memset(vis,false,sizeof(vis));
for(i=1;i<=n;i++)dis[i].d=inf;
dis[st].d=0;
dis[st].t=1;
for(j=1;j<=n;j++){
int k=-1;
for(i=1;i<=n;i++){
if(!vis[i]&&(k==-1||dis[i].d<dis[k].d))k=i;
}
if(k==-1)break;
vis[k]=true;
for(i=1;i<=n;i++){
if(vis[i])continue;
if(dis[i].d>dis[k].d+mp_dis[k][i]){
dis[i].d=dis[k].d+mp_dis[k][i];
pre_dis[i]=k;
dis[i].t=dis[k].t+1;
}
if(dis[i].d==dis[k].d+mp_dis[k][i]){
if(dis[i].t<=dis[k].t+1)continue;//无需更新
dis[i].t=dis[k].t+1;
pre_dis[i]=k;
}
}
}
}
void dijk_timepri(int st,int n){
int i,j;
memset(vis,false,sizeof(vis));
for(i=1;i<=n;i++)tim[i].t=inf;
tim[st].t=0;
for(j=1;j<=n;j++){
int k=-1;
for(i=1;i<=n;i++){
if(!vis[i]&&(k==-1||tim[i].t<tim[k].t))k=i;
}
if(k==-1)break;
vis[k]=true;
for(i=1;i<=n;i++){
if(vis[i])continue;
if(tim[i].t>tim[k].t+mp_time[k][i]){
tim[i].d=tim[k].d+mp_dis[k][i];
pre_time[i]=k;
tim[i].t=tim[k].t+mp_time[k][i];
}
if(tim[i].t==tim[k].t+mp_time[k][i]){
if(tim[i].d<=tim[k].d+mp_dis[k][i])continue;//无需更新
tim[i].d=tim[k].d+mp_dis[k][i];
pre_time[i]=k;
}
}
}
}
bool check_equal(int en){
while(en){
if(pre_dis[en]!=pre_time[en])return false;
en=pre_dis[en];
}
return true;
}
void print_dis(int en){
if(pre_dis[en]==0){
printf(" %d",en-1);
return ;
}
print_dis(pre_dis[en]);
printf(" => %d",en-1);
return ;
}
void print_time(int en){
if(pre_time[en]==0){
printf(" %d",en-1);
return ;
}
print_time(pre_time[en]);
printf(" => %d",en-1);
return ;
}
int n,m;
int main()
{
int a,b,i,c,d,j,e;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)for(j=1;j<=n;j++)mp_dis[i][j]=mp_time[i][j]=inf;
for(i=1;i<=m;i++){
scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
a++,b++;
mp_dis[a][b]=d;
mp_time[a][b]=e;
if(!c){
mp_dis[b][a]=d;
mp_time[b][a]=e;
}
}
scanf("%d%d",&a,&b);
a++,b++;
dijk_dispri(a,n);
dijk_timepri(a,n);
if(check_equal(b)){
printf("Time = %d; Distance = %d:",tim[b].t,dis[b].d);
print_dis(b);
printf("\n");
}
else {
printf("Time = %d:",tim[b].t);
print_time(b);
printf("\n");
printf("Distance = %d:",dis[b].d);
print_dis(b);
printf("\n");
}
// cout << "Hello world!" << endl;
return 0;
}