PAT (Advanced Level) Practice 1030 Travel Plan (30 point(s))

题目 PAT A 1030

题目大意

找到从起点到终点的最短路径，如果有多条，选择花费最小的一条。

解题思路

• Dijkstra求最短路径
• DFS输出路径，此处使用pre保存路径，最后，使用DFS递归即可求出路径

#include<bits/stdc++.h>
using namespace std;
const int maxn=505;
struct Edge{
    int to,dis,cost;
    Edge(int t,int d,int c):to(t),dis(d),cost(c){}
};
int n,m,s,dst;
vector<Edge>graph[maxn];
struct Point{
    int id,dis,cost;
    Point(int i,int d,int c):id(i),dis(d),cost(c){}
    bool operator<(const Point &p) const{
        return dis>p.dis;
    }
};
int dis[maxn],cost[maxn],pre[maxn];
void init(){
    fill(dis,dis+maxn,INT_MAX);
    fill(cost,cost+maxn,INT_MAX);
    for(int i=0;i<maxn;++i) pre[i]=i;
    dis[s]=0,cost[s]=0;
}
void Dijkstra(){
    priority_queue<Point>q;
    init();
    q.push(Point(s,0,0));
    while(!q.empty()){
        Point u=q.top();
        q.pop();
        for(int i=0;i<graph[u.id].size();++i){
            int to=graph[u.id][i].to;
            int distance=graph[u.id][i].dis;
            int Cost=graph[u.id][i].cost;
            if(dis[to]>u.dis+distance){
                dis[to]=u.dis+distance;
                cost[to]=u.cost+Cost;
                q.push(Point(to,dis[to],cost[to]));
                pre[to]=u.id;
                
            }else if((dis[to]==u.dis+distance)&&cost[to]>u.cost+Cost){
                cost[to]=u.cost+Cost;
                q.push(Point(to,dis[to],cost[to]));
                pre[to]=u.id;
            }
        }
    }
}
void dfs(int x){
    if(x==pre[x]){
        printf("%d ",x);
        return;
    } 
    dfs(pre[x]);
    printf("%d ",x);

}
int main(){
    while(~scanf("%d%d%d%d",&n,&m,&s,&dst)){
        int u,v,dd,c;
        for(int i=0;i<m;++i){
            scanf("%d%d%d%d",&u,&v,&dd,&c);
            graph[u].push_back(Edge(v,dd,c));
            graph[v].push_back(Edge(u,dd,c));
        }
        Dijkstra();
        dfs(dst);
        printf("%d %d\n",dis[dst],cost[dst]);
    }
    return 0;
}