7-2 天梯地图
题目描述:
本题要求你实现一个天梯赛专属在线地图,队员输入自己学校所在地和赛场地点后,该地图应该推荐两条路线:一条是最快到达路线;一条是最短距离的路线。题目保证对任意的查询请求,地图上都至少存在一条可达路线。
输入格式:
输入在第一行给出两个正整数N(2 ≤ N ≤ 500)和M,分别为地图中所有标记地点的个数和连接地点的道路条数。随后M行,每行按如下格式给出一条道路的信息:
其中V1和V2是道路的两个端点的编号(从0到N-1);如果该道路是从V1到V2的单行线,则one-way为1,否则为0;length是道路的长度;time是通过该路所需要的时间。最后给出一对起点和终点的编号。
输出格式:
#include <iostream>
using namespace std;
int n,m,s,d;
int sum[1000];
struct
{
int length;
int time;
} Graph[600][600];
struct
{
int pre;
int visited;
int length;
} Length[600];
struct
{
int pre;
int visited;
int time;
} Time[600];
void Inital()
{
for(int i=0; i<n; i++)
{
Time[i].visited=0;
Length[i].visited=0;
Time[i].time=Graph[s][i].time;
Length[i].length=Graph[s][i].length;
if(Time[i].time!=99999&&Length[i].length!=99999)
{
Time[i].pre=s;
Length[i].pre=s;
sum[i]=Graph[s][i].length;
}
}
Time[s].visited=1;
Length[s].visited=1;
}
void InitGraph( )
{
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
Graph[i][j].length=99999;
Graph[i][j].time=99999;
}
}
for(int i=0; i<m; i++)
{
int v1,v2,one_way,length,time;
cin>>v1>>v2>>one_way>>length>>time;
if(one_way==0)
{
Graph[v1][v2].length=length;
Graph[v1][v2].time=time;
Graph[v2][v1].length=length;
Graph[v2][v1].time=time;
}
else if(one_way==1)
{
Graph[v1][v2].length=length;
Graph[v1][v2].time=time;
}
}
}
void MinTime()
{
for(int i=1; i<n; i++)
{
int min=99999;
int v;
for(int j=0; j<n; j++)
{
if(!Time[j].visited&&(Time[j].time<min))
{
min=Time[j].time;
v =j;
}
}
Time[v].visited=1;
for(int k=0; k<n; k++)
{
if(!Time[k].visited)
{
if(Time[k].time>Graph[v][k].time+min)
{
Time[k].time=Graph[v][k].time+min;
sum[k]=sum[v]+Graph[v][k].length;
Time[k].pre=v;
}
else if(Time[k].time==Graph[v][k].time+min)
{
if(sum[k]>sum[v]+Graph[v][k].length)
{
sum[k]=sum[v]+Graph[v][k].length;
Time[k].pre=v;
}
}
}
}
}
}
void MinLength( )
{
for(int i=1; i<n; i++)
{
int MIN =99999;
int v;
for(int j=0; j<n; j++)
{
if(!Length[j].visited &&(Length[j].length<MIN))
{
MIN =Length[j].length;
v=j;
}
}
Length[v].visited=1;
for(int k=0; k<n; k++)
{
if(!Length[k].visited)
{
if(Length[k].length>Graph[v][k].length+MIN)
{
Length[k].length=Graph[v][k].length+MIN;
Length[k].pre=v;
}
else if(Length[k].length==Graph[v][k].length+MIN)
{
int a=0,b=0;
int pre =Length[k].pre;
while(pre!=s)
{
pre =Length[pre].pre;
a++;
}
pre=v;
while(pre !=s)
{
pre =Length[pre].pre;
b++;
}
if(a>b)
{
Length[k].pre=v;
}
}
}
}
}
}
int main( )
{
cin>>n>>m;
InitGraph( );
cin>>s>>d;
Inital();
MinTime();
MinLength();
int a[600],b[600];
int i=599,j=599;
int temp=d;
while(temp!=s)
{
a[i]=temp;
temp=Time[temp].pre;
i--;
}
temp=d;
while(temp!=s)
{
b[j]=temp;
temp=Length[temp].pre;
j--;
}
if(j==i)
{
int flag=1;
for(int k=i+1; k<600; k++)
{
if(a[k]!=b[k])
{
flag=0;
break;
}
}
if(flag==1)
{
cout<<"Time = "<<Time[d].time<<"; Distance = "<<Length[d].length<<": "<<s;
for(int k=i+1; k<=599; k++)
{
cout<<" => "<<a[k];
}
}
else if(flag==0)
{
cout <<"Time = "<<Time[d].time<<": "<<s;
for(int k=i+1; k<=599; k++)
{
cout<<" => "<<a[k];
}
cout <<endl;
cout <<"Distance = "<<Length[d].length<<": "<<s;
for(int k=j+1; k<=599; k++)
{
cout<<" => "<<b[k];
}
}
}
else
{
cout <<"Time = "<<Time[d].time<<": "<<s;
for(int k=i+1; k<=599; k++)
{
cout<<" => "<<a[k];
}
cout <<endl;
cout <<"Distance = "<<Length[d].length<<": "<<s;
for(int k=j+1; k<=599; k++)
{
cout<<" => "<<b[k];
}
}
}