1030. Travel Plan (30)
A traveler's map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to decide the shortest path between his/her starting city and the destination. If such a shortest path is not unique, you are supposed to output the one with the minimum cost, which is guaranteed to be unique.
Input Specification:
Each input file contains one test case. Each case starts with a line containing 4 positive integers N, M, S, and D, where N (<=500) is the number of cities (and hence the cities are numbered from 0 to N-1); M is the number of highways; S and D are the starting and the destination cities, respectively. Then M lines follow, each provides the information of a highway, in the format:
City1 City2 Distance Cost
where the numbers are all integers no more than 500, and are separated by a space.
Output Specification:
For each test case, print in one line the cities along the shortest path from the starting point to the destination, followed by the total distance and the total cost of the path. The numbers must be separated by a space and there must be no extra space at the end of output.
Sample Input4 5 0 3 0 1 1 20 1 3 2 30 0 3 4 10 0 2 2 20 2 3 1 20Sample Output
0 2 3 3 40
#include<stdio.h>
#include<string.h>
using namespace std;
//记录各顶点之间的距离
int distance[502][502];
//记录各定点之间的开销代价
int cost[502][502];
//从起点到各个顶点的距离
int Dis[502];
//从起点到各定点的开销代价
int Cost[502];
bool mark[502];
int path[502];
int main()
{
int n, m, s, t;
scanf("%d%d%d%d", &n, &m, &s, &t);
//数组初始化
memset(distance, 0, sizeof(distance));
memset(cost, 0, sizeof(cost));
memset(Dis, 0, sizeof(Dis));
memset(Cost, 0, sizeof(Cost));
memset(mark, false, sizeof(mark));
memset(path, -1, sizeof(path));
//input data
for(int i = 0; i < m; i ++)
{
int a, b, d, c;
scanf("%d%d%d%d", &a, &b, &d, &c);
distance[a][b] = distance[b][a] = d;
cost[a][b] = cost[b][a] = c;
}
int startPoint = s;
mark[startPoint] = true;
Dis[startPoint] = 0;
Cost[startPoint] = 0;
path[startPoint] = 0;
while(!mark[t])
{
for(int i = 0; i < n; i ++)
{
if(mark[i] || distance[startPoint][i] == 0)
continue;
else if(Dis[i]==0 || Dis[i] > Dis[startPoint]+distance[startPoint][i] || Dis[i]
== Dis[startPoint]+distance[startPoint][i] && Cost[i] > Cost[startPoint]+cost[startPoint][i])
{
Dis[i] = Dis[startPoint]+distance[startPoint][i];
Cost[i] = Cost[startPoint]+cost[startPoint][i];
path[i] = startPoint;
}
}
int min_dis = 0x7fffffff;
int min_cost = 0x7fffffff;
for(int i = 0; i < n; i ++)
{
if(mark[i] || Dis[i]==0)
continue;
if(Dis[i]<min_dis || Dis[i]==min_dis && Cost[i]<min_cost)
{
min_dis = Dis[i];
min_cost = Cost[i];
startPoint = i;
}
}
mark[startPoint] = true;
} // end of while
int res[502];
int i = 0;
for(int k = t; path[k] != s; i ++, k = path[k])
{
res[i] = path[k];
}
printf("%d", s);
for(int j = i-1; j >= 0; j --)
printf(" %d", res[j]);
printf(" %d %d %d\n", t, Dis[t], Cost[t]);
return 0;
}