PAT 甲级 1030 Travel Plan (30 分)(dijstra,较简单,但要注意是从0到n-1)
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)的更多相关文章
- 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 ...
- 【PAT甲级】1030 Travel Plan (30 分)(SPFA,DFS)
题意: 输入N,M,S,D(N,M<=500,0<S,D<N),接下来M行输入一条边的起点,终点,通过时间和通过花费.求花费最小的最短路,输入这条路径包含起点终点,通过时间和通过花费 ...
- PAT A 1030. Travel Plan (30)【最短路径】
https://www.patest.cn/contests/pat-a-practise/1030 找最短路,如果有多条找最小消耗的,相当于找两次最短路,可以直接dfs,数据小不会超时. #incl ...
- PAT 甲级 1030 Travel Plan
https://pintia.cn/problem-sets/994805342720868352/problems/994805464397627392 A traveler's map gives ...
- 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 ...
- 1030 Travel Plan (30分)(dijkstra 具有多种决定因素)
A traveler's map gives the distances between cities along the highways, together with the cost of ea ...
- PAT-1030 Travel Plan (30 分) 最短路最小边权 堆优化dijkstra+DFS
PAT 1030 最短路最小边权 堆优化dijkstra+DFS 1030 Travel Plan (30 分) A traveler's map gives the distances betwee ...
- [图算法] 1030. Travel Plan (30)
1030. Travel Plan (30) A traveler's map gives the distances between cities along the highways, toget ...
- PAT 甲级 1080 Graduate Admission (30 分) (简单,结构体排序模拟)
1080 Graduate Admission (30 分) It is said that in 2011, there are about 100 graduate schools ready ...
随机推荐
- 搭建nginx文件服务器
一.安装nginx服务 apt install nginx 二.修改nginx配置文件 cd /etc/nginx/conf.d/ vim download_server.conf server { ...
- Cloud Native Weekly |面对云平台宕机,企业如何止损
KubeEdge v0.2发布 KubeEdge在18年11月24日的上海KubeCon上宣布开源的一个开源项目,旨在依托K8S的容器编排和调度能力,实现云边协同.计算下沉.海量设备的平滑接入. Ku ...
- NginX——配置负载均衡
A. 在http模块加上upstream配置 upstream www.myweb.com { server 127.0.0.1:9100 weight=3; server ...
- 说一下 atomic 的原理?(未完成)
说一下 atomic 的原理?(未完成)
- python_datetime模块和time模块
1.datetime模块 获取当前时间: import datetime # 获取当前时间 ctime = datetime.datetime.now() print(ctime) 只显示:年-月-日 ...
- Lua 学习之基础篇二<Lua 数据类型以及函数库 汇总>
引言 前面讲了运算符,这里主要对Lua的数据处理相关的数据类型和函数库进行总结归纳,后面会再接着单独分开讲解具体使用. 首先因为Lua 是动态类型语言,变量不要类型定义,只需要为变量赋值. 值可以存储 ...
- eclipse中toolbar位置的系统URI
org.eclipse.ui.ide.IIDEActionConstants 这个类里存了系统toolbar,菜单等URI 定义自己的toolbar或者menu时,指定位置after=addition ...
- VS 项目清理小工具 ClearSolution
简介 VS项目清理小工具,通过INI配置文件快速清理项目,清除无用的数据库等文件与文件夹,简单实用. 支持平台 Windows 开源许可 ClearSolution 遵循 [Apache 协议],使用 ...
- 了解 Spring Boot
Spring Boot是什么,解决哪些问题? SpringBoot是伴随着Spring4.0诞生的: 从字面理解,Boot是引导的意思,因此SpringBoot帮助开发者快速搭建Spring框架: S ...
- P4568 [JLOI2011]飞行路线 分层图最短路
思路:裸的分层图最短路 提交:1次 题解: 如思路 代码: #include<cstdio> #include<iostream> #include<cstring> ...