1030. Travel Plan (30)

1030. Travel Plan (30)
时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B
判题程序 Standard 作者 CHEN, Yue

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 Input
4 5 0 3
0 1 1 20
1 3 2 30
0 3 4 10
0 2 2 20
2 3 1 20
Sample Output
0 2 3 3 40

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <cfloat>
#include <map>

#define INF INT32_MAX
typedef struct node
{
    int w;
    int c;
}Node;

using namespace std;
const int MaxN = 510;
int C[MaxN];
int des[MaxN] ,pre[MaxN];
bool visited[MaxN] = { false };
Node G[MaxN][MaxN];
int N;


void Dijkstra(int s)
{
    fill(des, des + N, INF);
    fill(C, C + N, INF);
    des[s] = 0; C[s] = 0;

    for (int i = 0; i < N; ++i)
        pre[i] = i;

    for (int i = 0,Min,u; i < N; ++i)
    {
        Min = INF; u = -1;
        for (int k = 0; k < N; ++k)
        {
            if (!visited[k] && Min > des[k])
            {
                Min = des[k];
                u = k;
            }
        }

        if (u == -1)return;
        visited[u] = true;

        for (int v = 0; v < N; ++v)
        {
            if (!visited[v] && G[u][v].w != INF)
            {
                if (des[v] > G[u][v].w + des[u])
                {
                    des[v] = G[u][v].w + des[u];
                    C[v] = G[u][v].c + C[u];
                    pre[v] = u;
                }
                else if (des[v] == G[u][v].w + des[u] && C[v] > G[u][v].c + C[u])
                {
                    C[v] = G[u][v].c + C[u];
                    pre[v] = u;
                }
            }
        }
    }
}


void DFS(int e,int s)
{
    if (e == s)
    {
        cout << e << " ";
        return;
    }
    DFS(pre[e],s);

    cout << e << " ";
}

int main()
{
#ifdef _DEBUG
    freopen("data.txt", "r+", stdin);
#endif // _DEBUG

    std::ios::sync_with_stdio(false);

    int M, S, D;
    cin >> N >> M >> S >> D;
    for (int i = 0; i < N; ++i)
        for (int k = 0; k < N; ++k)
            G[i][k].c = G[i][k].w = INF;

    for (int k = 0; k < M; ++k)
    {
        int u, v;
        cin >> u >> v;
        cin >> G[u][v].w >> G[u][v].c;
        G[v][u].c = G[u][v].c;
        G[v][u].w = G[u][v].w;
    }

    Dijkstra(S);

    DFS(D,S);
    cout << des[D] << " " << C[D];
    return 0;
}