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 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

分析:水题~

方法一:本题没有涉及有多个前驱结点,直接用Dijkstra,注意用递归输出最短路径的写法即可。

 /**
 * Copyright(c)
 * All rights reserved.
 * Author : Mered1th
 * Date : 2019-02-22-21.43.06
 * Description : A1030
 */
 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<cmath>
 #include<algorithm>
 #include<string>
 #include<unordered_set>
 #include<map>
 #include<vector>
 #include<set>
 using namespace std;
 ;
 ;
 int n,m,st,ed;
 int d[maxn],c[maxn],cost[maxn][maxn],G[maxn][maxn],pre[maxn];
 vector<int> tempPath,path;
 bool vis[maxn]={false};
 void Dijkstra(int s){
     fill(d,d+maxn,INF);
     fill(c,c+maxn,INF);
     d[s]=;
     c[s]=;
     ;i<n;i++) pre[i]=i;
     ;i<n;i++){
         ,MIN=INF;
         ;j<n;j++){
             if(d[j]<MIN && vis[j]==false){
                 u=j;
                 MIN=d[j];
             }
         }
         ) return;
         vis[u]=true;
         ;v<n;v++){
             if(G[u][v]!=INF && vis[v]==false){
                 if(d[v]>d[u]+G[u][v]){
                     d[v]=d[u]+G[u][v];
                     c[v]=c[u]+cost[u][v];
                     pre[v]=u;
                 }
                 else if(d[v]==d[u]+G[u][v]){
                     if(c[v]>c[u]+cost[u][v]){
                         c[v]=c[u]+cost[u][v];
                         pre[v]=u;
                     }
                 }
             }
         }
     }
 }

 void DFS(int s,int v){
     if(v==st){
         printf("%d ",st);
         return;
     }
     DFS(s,pre[v]);
     printf("%d ",v);
 }

 int main(){
 #ifdef ONLINE_JUDGE
 #else
     freopen("1.txt", "r", stdin);
 #endif
     cin>>n>>m>>st>>ed;
     int a,b,dis,cos;
     fill(G[],G[]+maxn*maxn,INF);
     ;i<m;i++){
         scanf("%d%d%d%d",&a,&b,&dis,&cos);
         G[a][b]=G[b][a]=dis;
         cost[a][b]=cost[b][a]=cos;
     }
     Dijkstra(st);
     DFS(st,ed);
     printf("%d %d\n",d[ed],c[ed]);
     ;
 }

方法二:Dijkstra+DFS写法

在写Dijkstra的时候不考虑路径的开销cost,只记录最短路径。

而在写DFS函数内再计算每条最短路径的开销,求出最小开销的最短路径并输出。

 /**
 * Copyright(c)
 * All rights reserved.
 * Author : Mered1th
 * Date : 2019-02-22-21.43.06
 * Description : A1030
 */
 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<cmath>
 #include<algorithm>
 #include<string>
 #include<unordered_set>
 #include<map>
 #include<vector>
 #include<set>
 using namespace std;
 ;
 ;
 int n,m,st,ed,minCost=INF;
 int d[maxn],cost[maxn][maxn],G[maxn][maxn];
 vector<int> tempPath,path;
 vector<int> pre[maxn];
 bool vis[maxn]={false};
 void Dijkstra(int s){
     fill(d,d+maxn,INF);
     d[s]=;
     ;i<n;i++){
         ,MIN=INF;
         ;j<n;j++){
             if(d[j]<MIN && vis[j]==false){
                 u=j;
                 MIN=d[j];
             }
         }
         ) return;
         vis[u]=true;
         ;v<n;v++){
             if(G[u][v]!=INF && vis[v]==false){
                 if(d[v]>d[u]+G[u][v]){
                     d[v]=d[u]+G[u][v];
                     pre[v].clear();
                     pre[v].push_back(u);
                 }
                 else if(d[v]==d[u]+G[u][v]){
                     pre[v].push_back(u);
                 }
             }
         }
     }
 }

 void DFS(int v){
     if(v==st){
         tempPath.push_back(v);
         ;
         ;i>;i--){
             ];
             tempCost+=cost[id][idNext];
         }
         if(tempCost<minCost){
             minCost=tempCost;
             path=tempPath;
         }
         tempPath.pop_back();
         return;
     }
     tempPath.push_back(v);
     ;i<pre[v].size();i++){
         DFS(pre[v][i]);
     }
     tempPath.pop_back();
 }

 int main(){
 #ifdef ONLINE_JUDGE
 #else
     freopen("1.txt", "r", stdin);
 #endif
     cin>>n>>m>>st>>ed;
     int a,b,dis,cos;
     fill(G[],G[]+maxn*maxn,INF);
     ;i<m;i++){
         scanf("%d%d%d%d",&a,&b,&dis,&cos);
         G[a][b]=G[b][a]=dis;
         cost[a][b]=cost[b][a]=cos;
     }
     Dijkstra(st);
     DFS(ed);
     ;i>=;i--){
         printf("%d ",path[i]);
     }
     printf("%d %d\n",d[ed],minCost);
     ;
 }

1030 Travel Plan (30 分)的更多相关文章

  1. PAT 甲级 1030 Travel Plan (30 分)(dijstra,较简单,但要注意是从0到n-1)

    1030 Travel Plan (30 分)   A traveler's map gives the distances between cities along the highways, to ...

  2. 1030 Travel Plan (30分)(dijkstra 具有多种决定因素)

    A traveler's map gives the distances between cities along the highways, together with the cost of ea ...

  3. 【PAT甲级】1030 Travel Plan (30 分)(SPFA,DFS)

    题意: 输入N,M,S,D(N,M<=500,0<S,D<N),接下来M行输入一条边的起点,终点,通过时间和通过花费.求花费最小的最短路,输入这条路径包含起点终点,通过时间和通过花费 ...

  4. PAT-1030 Travel Plan (30 分) 最短路最小边权 堆优化dijkstra+DFS

    PAT 1030 最短路最小边权 堆优化dijkstra+DFS 1030 Travel Plan (30 分) A traveler's map gives the distances betwee ...

  5. [图算法] 1030. Travel Plan (30)

    1030. Travel Plan (30) A traveler's map gives the distances between cities along the highways, toget ...

  6. 1030 Travel Plan (30)(30 分)

    A traveler's map gives the distances between cities along the highways, together with the cost of ea ...

  7. PAT A 1030. Travel Plan (30)【最短路径】

    https://www.patest.cn/contests/pat-a-practise/1030 找最短路,如果有多条找最小消耗的,相当于找两次最短路,可以直接dfs,数据小不会超时. #incl ...

  8. 1030. Travel Plan (30)

    时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A traveler's map gives the dista ...

  9. PAT Advanced 1030 Travel Plan (30) [Dijkstra算法 + DFS,最短路径,边权]

    题目 A traveler's map gives the distances between cities along the highways, together with the cost of ...

  10. PAT (Advanced Level) 1030. Travel Plan (30)

    先处理出最短路上的边.变成一个DAG,然后在DAG上进行DFS. #include<iostream> #include<cstring> #include<cmath& ...

随机推荐

  1. CUDA ---- Constant Memory

    CONSTANT  MEMORY constant Memory对于device来说只读但是对于host是可读可写.constant Memory和global Memory一样都位于DRAM,并且有 ...

  2. anu - component

    import { extend, isFn, options, clearArray, noop } from "./util"; import { CurrentOwner } ...

  3. Cisco ASA(8.4)端口映射设定(ASDM)

    1.进入到Configuration→firewall→NAT Rules画面. 2.点“services”添加服务端口,此案例添加TCP 1443和UDP 1443端口映射 3.添加“Network ...

  4. Windows Security Login

    /********************************************************************************* * Windows Securit ...

  5. VC++ 6.0 C8051F340 USB 通信 CAN 数据解析

    // HelloWorld.cpp : Defines the entry point for the console application. // /*********************** ...

  6. 有道词典 纯净版 - imsoft.cnblogs

    软件名称:有道词典软件版本:5.4 正式版(5.4.46.5554)软件主页:http://cidian.youdao.com/软件定制:飞扬时空更新日期:2013年8月26日 软件简介: 有道词典是 ...

  7. CodeForces - 367E:Sereja and Intervals(组合数&&DP)

    Sereja is interested in intervals of numbers, so he has prepared a problem about intervals for you. ...

  8. zookeeper windows 下配置和基础命令

    原文链接:http://blog.csdn.net/woshioosm/article/details/45560177 1, 解压zookeeper ,在目录下建立文件夹 data 和log 2,在 ...

  9. CF1119 Global Round 2

    CF1119A Ilya and a Colorful Walk 这题二分是假的.. \(1,2,1,2,1\) 有间隔为 \(3\) 的,但没有间隔为 \(2\) 的.开始被 \(hack\) 了一 ...

  10. No result defined for action com.nynt.action.ManageAction and result input问题

    No result defined for action com.nynt.action.ManageAction and result input 问题原因: 1). 在action类中定义的一个r ...