可以转到我的CSDN查看同样的文章https://blog.csdn.net/weixin_44385565/article/details/89003683

1131 Subway Map (30 分)

In the big cities, the subway systems always look so complex to the visitors. To give you some sense, the following figure shows the map of Beijing subway. Now you are supposed to help people with your computer skills! Given the starting position of your user, your task is to find the quickest way to his/her destination.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (≤ 100), the number of subway lines. Then N lines follow, with the i-th (,) line describes the i-th subway line in the format:

M S[1] S[2] ... S[M]

where M (≤ 100) is the number of stops, and S[i]'s (i=1,⋯,M) are the indices of the stations (the indices are 4-digit numbers from 0000 to 9999) along the line. It is guaranteed that the stations are given in the correct order -- that is, the train travels between S[i] and S[i+1] (i=1,⋯,M−1) without any stop.

Note: It is possible to have loops, but not self-loop (no train starts from S and stops at S without passing through another station). Each station interval belongs to a unique subway line. Although the lines may cross each other at some stations (so called "transfer stations"), no station can be the conjunction of more than 5 lines.

After the description of the subway, another positive integer K (≤ 10) is given. Then K lines follow, each gives a query from your user: the two indices as the starting station and the destination, respectively.

The following figure shows the sample map.

Note: It is guaranteed that all the stations are reachable, and all the queries consist of legal station numbers.

Output Specification:

For each query, first print in a line the minimum number of stops. Then you are supposed to show the optimal path in a friendly format as the following:

Take Line#X1 from S1 to S2.
Take Line#X2 from S2 to S3.
......

where Xi's are the line numbers and Si's are the station indices. Note: Besides the starting and ending stations, only the transfer stations shall be printed.

If the quickest path is not unique, output the one with the minimum number of transfers, which is guaranteed to be unique.

Sample Input:


Sample Output:

Take Line# from  to .

Take Line# from  to .
Take Line# from to .
Take Line# from to . Take Line# from to .
Take Line# from to .
Take Line# from to .

题目大意:求最短路径(停靠站点次数最少的路径),停靠站点次数相同时选择转站次数最少的路径。

思路:这是一个有环无向图,需要开辟一个visit映射(或者数组)来标记已经访问过的节点,回溯的时候再更改标记。用unordered_map来存储每两个站点之间的地铁线路,用于中转站的判断(前面的节点到当前节点的线路与当前节点到后一节点的线路不同的话那么当前节点为中转站)。DFS里面设置一个临时路径tpath(存储当前的路径),搜索的过程中,每一次到达destination的时候都对临时路径进行判断,使得最终路径path始终指向当前的最短路径。。。题目虽然不难,但是相当的繁琐~~

 #include<iostream>
#include<vector>
#include<unordered_map>
using namespace std; unordered_map<int,vector<int>> G;//G存储无向图信息
unordered_map<int,int> Line;//Line存储每两个站点间的线路信息 int mintrans,minsite;//最少转站次数、最少过站次数
/*DFS传递的参数很多,但是全局变量也不是很方便*/
void DFS(unordered_map<int,bool> &visit,vector<int> &path,vector<int> &tpath,int start,int &end,int sitecnt);
int transferNum(vector<int> &tpath);//获取路径的中转站数量 int main()
{
int N,M,K;
scanf("%d",&N);
for(int i=;i<=N;i++){
int pre,cur;
scanf("%d%d",&M,&pre);
for(int j=;j<M;j++){
scanf("%d",&cur);
G[pre].push_back(cur);
G[cur].push_back(pre);
Line[pre*+cur]=Line[cur*+pre]=i;
pre=cur;
}
}
scanf("%d",&K);
for(int i=;i<K;i++){
int start,end,sitecnt=;
mintrans=,minsite=;//数据初始化
scanf("%d%d",&start,&end);
vector<int> path,tpath;//path存储最终路径,tpath存储临时路径
unordered_map<int,bool> visit;//标记访问过的节点
DFS(visit,path,tpath,start,end,sitecnt);
/*输出结果*/
int preline=Line[path[]*+path[]],presite=start,f=path.size();
printf("%d\n",f-);
for(int j=;j<f;j++){
int tmpline=Line[path[j-]*+path[j]];
if(preline!=tmpline){
printf("Take Line#%d from %04d to %04d.\n",preline,presite,path[j-]);
presite=path[j-];
preline=tmpline;
}
}
if(preline==Line[path[f-]*+path[f-]])//终点站属于中转站的时候要记得输出
printf("Take Line#%d from %04d to %04d.\n",preline,presite,end);
}
return ;
}
int transferNum(vector<int> &tpath)
{
int pre=Line[tpath[]*+tpath[]],transcnt=;
for(int i=;i<tpath.size();i++){
int tmp=Line[tpath[i-]*+tpath[i]];
if(pre!=tmp) transcnt++;
pre=tmp;
}
return transcnt;
}
void DFS(unordered_map<int,bool> &visit,vector<int> &path,vector<int> &tpath,int start,int &end,int sitecnt)
{
if(!visit[start]){
visit[start]=true;
tpath.push_back(start);
}
if(start==end){
int transcnt=transferNum(tpath);
if(minsite>sitecnt||(minsite==sitecnt&&mintrans>transcnt)){//找到比当前路径的站点数更少、转站数更少的路径则替换路径
minsite=sitecnt;
mintrans=transcnt;
path=tpath;
}
return;//到达终点则结束当前维度的搜索
}
for(int i=;i<G[start].size();i++){
if(!visit[G[start][i]]){
DFS(visit,path,tpath,G[start][i],end,sitecnt+);
visit[G[start][i]]=false;
tpath.pop_back();
}
}
}

PAT甲级——1131 Subway Map (30 分)的更多相关文章

  1. PAT甲级1131. Subway Map

    PAT甲级1131. Subway Map 题意: 在大城市,地铁系统对访客总是看起来很复杂.给你一些感觉,下图显示了北京地铁的地图.现在你应该帮助人们掌握你的电脑技能!鉴于您的用户的起始位置,您的任 ...

  2. PAT甲级1131 Subway Map【dfs】【输出方案】

    题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805347523346432 题意: 告诉你一个地铁线路图,站点都是 ...

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

  4. PAT 甲级 1049 Counting Ones (30 分)(找规律,较难,想到了一点但没有深入考虑嫌麻烦)***

    1049 Counting Ones (30 分)   The task is simple: given any positive integer N, you are supposed to co ...

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

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

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

  7. PAT 甲级 1026 Table Tennis (30 分)(坑点很多,逻辑较复杂,做了1天)

    1026 Table Tennis (30 分)   A table tennis club has N tables available to the public. The tables are ...

  8. PAT 甲级 1022 Digital Library (30 分)(字符串读入getline,istringstream,测试点2时间坑点)

    1022 Digital Library (30 分)   A Digital Library contains millions of books, stored according to thei ...

  9. PAT甲级——A1131 Subway Map【30】

    In the big cities, the subway systems always look so complex to the visitors. To give you some sense ...

随机推荐

  1. 2014 ACM-ICPC Beijing Invitational Programming Contest

    点击打开链接 Happy Reversal Time Limit: 1000ms Memory Limit: 65536KB 64-bit integer IO format: %lld      J ...

  2. 使用Swift开发iOS项目、UI创建、方法调用

    //1.root控制器的创建        var rootCtrl =RootViewController()        var root:UINavigationController =UIN ...

  3. 在windows下把Mongodb设置系统服务

    把Mongodb Server 设置为系统,方便启动与停止 今天一时兴起在本地安装了下Mongodb服务,安装完后,创建了配置文件为数据库服务指明在哪里存储数据库原始文件,随即就启动了mongo se ...

  4. awk 根据外部变量匹配某一域值

    shell>> i='a' awk '$1 ~ /'$i'/ {print $0}' test.txt awk中,变量 增加单引号即可

  5. Hibernate 模糊查询 ' %?% ' SQL执行异常

    今天我在使用Hibernate 的SQL预编译之后注入参数的形式写了一条模糊查询语句.刚开始我是这么写的

  6. Java 高阶 —— try/catch

    // try catch 在 for 循环外 try { for(int i = 0; i < max; i++) { String myString = ...; float myNum = ...

  7. C# 获取QQ好友列表信息的实现

    分析部分 当我们访问QQ空间的时候,大家可以在右侧的发现一个这样的统计信息  当点击这个链接的时候,会跳转到  这样一个URL 这个URl可以管理好友,当然也就能读取到好友  上面我们是在浏览器中的操 ...

  8. 洛谷P1462通往奥格瑞玛的道路——二分答案最短路

    题目:https://www.luogu.org/problemnew/show/P1462 最大值最小问题,二分答案. 代码如下: #include<iostream> #include ...

  9. css animation 简写和参数

  10. 在xshell中使用Linux语言打开错误提示

    上线项目到服务器后, 有时候有的功能跟本地调试的不一样,这时候就需要设置打开display_errors = On: 首先,cd .. 进入上一级,ll 罗列当前目录,跟home当前目录的有这个usr ...