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 (≤) 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 Mlines 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

题解:

第一行是四个数字,n,m,s,d,分别代表有n个城市,有m条路,起点城市s和终点城市d;

后面跟着m行数据,代表道路的情况,每一行四个数字,City1 City2 Distance Cost,让你求出来由起点到终点的最短的路径,如果距离相等时选择花费最小的道路,最后输出道路和最短的距离和花费;

这道题也是用dijkstra算法来进行求解,记得在最短路径的判断中加入对于花费的判断(即,当距离一样时,选择花费更小的路径);

对于路径的存储,用一个数组,每一次路径变化时,只需要存下来这个城市是由哪个城市来的,最后一个栈从终点城市回溯输出即可。

第一次没过:

没注意到城市是从0到n-1,我太粗心直接写成了1到n编号,后来才发现。

这道题没有重边的情况,但是要注意将来会不会遇到重边的特殊情况。

AC代码:

#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
int n,m,s,dis;
int e[][];//距离
int d[];//距离
int dc[];//花费
int ec[][];//花费
bool v[];//标记有没有遍历过
int p[];//记录路径
void dijstra(int s){
memset(v,,sizeof(v));
for(int i=;i<=n;i++){
d[i]=e[s][i];
dc[i]=ec[s][i];
p[i]=s;
}
v[s]=;
for(int i=;i<=n;i++){
int k=-;
int mi=inf;
for(int j=;j<=n;j++){
if(mi>d[j]&&!v[j]){
k=j;
mi=d[j];
}
}
if(k==-){
break;
}
v[k]=;
for(int j=;j<=n;j++){
if(d[j]>d[k]+e[k][j]){
d[j]=d[k]+e[k][j];
dc[j]=dc[k]+ec[k][j];
p[j]=k;
}else if(d[j]==d[k]+e[k][j]){
if(dc[j]>dc[k]+ec[k][j]){
dc[j]=dc[k]+ec[k][j];
p[j]=k;
} }
}
}
}
int main()
{
cin>>n>>m>>s>>dis;
s++;//我是以1-n编号
dis++;
for(int i=;i<=n;i++){
for(int j=;j<=n;j++){
if(i==j){
e[i][j]=ec[i][j]=;
}else{
e[i][j]=ec[i][j]=inf;
}
}
}
for(int i=;i<=m;i++){
int u,v,dd,cc;
cin>>u>>v>>dd>>cc;
u++;//我是以1-n编号
v++;
e[u][v]=e[v][u]=dd;
ec[u][v]=ec[v][u]=cc;
}
dijstra(s);
//输出
stack<int>sta;
while(!sta.empty()) sta.pop();
int pair=dis;
while(pair!=s){
sta.push(pair);
pair=p[pair];
}
cout<<s-<<" ";
while(!sta.empty()){
cout<<sta.top()-<<" ";
sta.pop();
}
cout<<d[dis]<<" "<<dc[dis];
return ;
}

PAT 甲级 1030 Travel Plan (30 分)(dijstra,较简单,但要注意是从0到n-1)的更多相关文章

  1. PAT 甲级 1072 Gas Station (30 分)(dijstra)

    1072 Gas Station (30 分)   A gas station has to be built at such a location that the minimum distance ...

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

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

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

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

  4. PAT 甲级 1030 Travel Plan

    https://pintia.cn/problem-sets/994805342720868352/problems/994805464397627392 A traveler's map gives ...

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

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

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

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

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

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

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

  9. PAT 甲级 1080 Graduate Admission (30 分) (简单,结构体排序模拟)

    1080 Graduate Admission (30 分)   It is said that in 2011, there are about 100 graduate schools ready ...

随机推荐

  1. js中对new Date() 中转换字符串方法toLocaleString的使用

    提供特定于区域设置的日期和时间格式. dateTimeFormatObj = new Intl.DateTimeFormat([locales][, options]) dateTimeFormatO ...

  2. 关于operator void* 操作符

    在<大规模C++程序设计>这本书中谈到了迭代器模式. 他提供了这样的一个迭代器的例子     这个for循环中判断终止的写法,有点意思,做一下记录. 这个地方的本质是这样的:C++ 编译器 ...

  3. vue-cli3 clone项目后如何安装插件及依赖模块启动项目

    一. 前提条件1.确保使用的是Node 8.11.0+和NPM 3+:2.确保已全局安装vue-clie3:npm install -g @vue/cli: 二.安装依赖 1.在安装依赖之前,先安装官 ...

  4. docker换源

    方案一 修改或新增 /etc/docker/daemon.json # vi /etc/docker/daemon.json { "registry-mirrors": [&quo ...

  5. python 传参

    python不允许程序员选择采用传值还是传引用.Python参数传递采用的肯定是“传对象引用”的方式.这种方式相当于传值和传引用的一种综合.如果函数收到的是一个可变对象(比如字典或者列表)的引用,就能 ...

  6. Tarjan算法【阅读笔记】

    应用:线性时间内求出无向图的割点与桥,双连通分量.有向图的强连通分量,必经点和必经边. 主要是求两个东西,dfn和low 时间戳dfn:就是dfs序,也就是每个节点在dfs遍历的过程中第一次被访问的时 ...

  7. Mac: ld: library not found for -lgcc_s.10.4

    Mac: ld: library not found for -lgcc_s.10.4   Checking for cc... ld: library not found for -lgcc_s.1 ...

  8. 03_已解决 [salt.master :2195][ERROR ][6219] Failed to allocate a jid. The requested returner 'mysql' could not be loaded.

    总结: 对于python2.7环境下的salt来说,要安装pip install mysql-python 对于python3环境下的salt来说,pip install mysqlclient的时候 ...

  9. jQuery.each(object, [callback])

    jQuery.each(object, [callback]) 概述 通用遍历方法,可用于遍历对象和数组.大理石平台检定规程 不同于遍历 jQuery 对象的 $().each() 方法,此方法可用于 ...

  10. 关闭tomcat8080端口

    netstat -ano | findstr 8080taskkill /F /PID 1234