A1131. 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 (i = 1, ..., N) 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:
4
7 1001 3212 1003 1204 1005 1306 7797
9 9988 2333 1204 2006 2005 2004 2003 2302 2001
13 3011 3812 3013 3001 1306 3003 2333 3066 3212 3008 2302 3010 3011
4 6666 8432 4011 1306
3
3011 3013
6666 2001
2004 3001
Sample Output:
2
Take Line#3 from 3011 to 3013.
10
Take Line#4 from 6666 to 1306.
Take Line#3 from 1306 to 2302.
Take Line#2 from 2302 to 2001.
6
Take Line#2 from 2004 to 1204.
Take Line#1 from 1204 to 1306.
Take Line#3 from 1306 to 3001.
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<map>
#include<vector>
using namespace std;
vector<int>G[];
int visit[] = {}, transfer = , ansTran = ;
map<int,int>mp[];
vector<int> ans, temp;
void DFS(int pre, int s, int d){
temp.push_back(s);
visit[s] = ;
if(s == d){
if(ans.size() == || ans.size() > temp.size()){
ans = temp;
ansTran = transfer;
}else if(ans.size() == temp.size() && transfer < ansTran){
ans = temp;
ansTran = transfer;
}
temp.pop_back();
visit[s] = ;
return;
}
for(int i = ; i < G[s].size(); i++){
if(visit[G[s][i]] == ){
if(pre != s && mp[pre][s] != mp[s][G[s][i]])
transfer++;
DFS(s, G[s][i], d);
if(pre != s && mp[pre][s] != mp[s][G[s][i]])
transfer--;
}
}
visit[s] = ;
temp.pop_back();
return;
}
int main(){
int N, M;
scanf("%d", &N);
for(int i = ; i < N; i++){
int v;
scanf("%d%d", &M, &v);
for(int j = ; j < M; j++){
int v2;
scanf("%d", &v2);
G[v].push_back(v2);
G[v2].push_back(v);
mp[v][v2] = i + ;
mp[v2][v] = i + ;
v = v2;
}
}
int K;
scanf("%d", &K);
for(int i = ; i < K; i++){
int s, d;
scanf("%d%d", &s, &d);
transfer = ;
ansTran = ;
DFS(s,s,d);
int preLine = mp[ans[]][ans[]], preS = ans[];
printf("%d\n", ans.size() - );
for(int i = ; i < ans.size() - ; i++){
if(mp[ans[i]][ans[i+]] != preLine){
printf("Take Line#%d from %04d to %04d.\n", preLine, preS, ans[i]);
preS = ans[i];
preLine = mp[ans[i]][ans[i+]];
}
}
printf("Take Line#%d from %04d to %04d.\n", preLine, preS, d);
ans.clear();
}
cin >> N;
return ;
}
总结:
1、题意:给出地铁线路图和起点终点,求出换乘路线,要求经过站点最少,如果有一样的要求换乘次数最少。
2、求路线就是求最短路,dijkstra或者dfs应该都可以,注意是求最短路,和图的遍历不一样,所以在dfs的时候不要忘记在递归调用前置visit数组,在递归结束后再恢复visit数组。其次如有其他参数,也需要在递归前设置,递归后恢复。
3、主要是输出换乘线路时比较麻烦。应该用两个点标记一条线。用map<int, int>标记地铁的几号线。对得到的路径进行输出时,判断,当路径上有abc三点,ab的线路不等于bc时,说明b是换乘地点,需要输出。
4、由于地图较大,节点id为4位数,所以最好使用邻接表而非邻接矩阵来存储图G。
A1131. Subway Map (30)的更多相关文章
- PAT甲级——A1131 Subway Map【30】
In the big cities, the subway systems always look so complex to the visitors. To give you some sense ...
- PAT 1131. Subway Map (30)
最短路. 记录一下到某个点,最后是哪辆车乘到的最短距离.换乘次数以及从哪个位置推过来的,可以开$map$记录一下. #include<map> #include<set> #i ...
- PAT A1131 Subway Map
dfs,选择最优路径并输出~ 这道题难度非常炸裂,要求完完整整自己推一遍,DFS才算过关!思路:一遍dfs,过程中要维护两个变量,minCnt 中途停靠最少的站.minTransfer需要换成的最少次 ...
- PAT_A1131#Subway Map
Source: PAT A1131 Subway Map (30 分) Description: In the big cities, the subway systems always look s ...
- PAT甲级——1131 Subway Map (30 分)
可以转到我的CSDN查看同样的文章https://blog.csdn.net/weixin_44385565/article/details/89003683 1131 Subway Map (30 ...
- PAT甲级1131. Subway Map
PAT甲级1131. Subway Map 题意: 在大城市,地铁系统对访客总是看起来很复杂.给你一些感觉,下图显示了北京地铁的地图.现在你应该帮助人们掌握你的电脑技能!鉴于您的用户的起始位置,您的任 ...
- 1131 Subway Map(30 分)
In the big cities, the subway systems always look so complex to the visitors. To give you some sense ...
- 1131 Subway Map DFS解法 BFS回溯!
In the big cities, the subway systems always look so complex to the visitors. To give you some sense ...
- PAT 1131 Subway Map
In the big cities, the subway systems always look so complex to the visitors. To give you some sense ...
随机推荐
- Hbase数据结构模型
- UDP反射DDoS攻击原理和防范
东南大学:UDP反射DDoS攻击原理和防范 2015-04-17 中国教育网络 李刚 丁伟 反射攻击的防范措施 上述协议安装后由于有关服务默认处于开启状态,是其被利用的一个重要因素.因此,防范可以从配 ...
- 莫烦keras学习自修第五天【CNN卷积神经网络】
1.代码实战 #!/usr/bin/env python #! _*_ coding:UTF-8 _*_ import numpy as np np.random.seed(1337) # for r ...
- javascript中 json数据的解析与序列化
首先明确一下概念: json格式数据本质上就是字符串: js对象:JavaScript 中的几乎所有事务都是对象:字符串.数字.数组.日期.函数,等等. json数据的解析: 就是把后端传来的json ...
- 如何设置C-Lodop打印控件的端口
Lodop是一款功能强大的打印控件,在一些浏览器不再支持np插件之后,Lodop公司又推出了C-Lodop,C-Lodop是以服务的方式解决web打印,摆脱了对浏览器的依赖,支持了所有的浏览器. 该控 ...
- 2.23日刷数论题后总结(题目整理自SCUT
第一道:Rightmost digit 求N^N次最后一个数字 快速幂mod10咯 代码如下: #include <cstdio> #define ll long long using n ...
- Nginx 磁盘IO的优化
L:132
- 在 ubuntu 中安装 python3.5、 tornado、 pymysql
一.在 ubuntu 中安装 python3.5 1.首先,在系统中是自带python2.7的.不要卸载,因为一些系统的东西是需要这个的.python2.7和python3.5是可以共存的. 命令如下 ...
- 序列化模块组 pickle,json , xml , shelve , configparser
序列化是什么? 序列化指的是将内存中的数据结构转化为一种中间格式 并存储到硬盘上. 反序列化是什么? 将硬盘上存储的中间格式数据再还原为内存中的数据结构. 为什么要有序列化? 是为了将数据持久存储 较 ...
- ram自己写?用IP?
前言 ram这种东西,可以用ip方便,也可以自己写代码描述它. 以下讨论单口ram:8bit*256 流程 1.IP: 使用IP当然是最方便的事情啦,但可移植性差而且可定制性较差. 仿真波形: 2.V ...