Poj 1847 Tram ( 最短路变形
来源:互联网 发布:北京金山软件年终奖 编辑:程序博客网 时间:2024/06/06 06:37
Tram
Description
Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out of the intersection. When the tram enters the intersection it can leave only in the direction the switch is pointing. If the driver wants to go some other way, he/she has to manually change the switch.
When a driver has do drive from intersection A to the intersection B he/she tries to choose the route that will minimize the number of times he/she will have to change the switches manually.
Write a program that will calculate the minimal number of switch changes necessary to travel from intersection A to intersection B.
Input
The first line of the input contains integers N, A and B, separated by a single blank character, 2 <= N <= 100, 1 <= A, B <= N, N is the number of intersections in the network, and intersections are numbered from 1 to N.
Each of the following N lines contain a sequence of integers separated by a single blank character. First number in the i-th line, Ki (0 <= Ki <= N-1), represents the number of rails going out of the i-th intersection. Next Ki numbers represents the intersections directly connected to the i-th intersection.Switch in the i-th intersection is initially pointing in the direction of the first intersection listed.
Output
The first and only line of the output should contain the target minimal number. If there is no route from A to B the line should contain the integer “-1”.
Sample Input
3 2 12 2 32 3 12 1 2
Sample Output
0
题意
很有意思的一道题 问 火车默认拐道节点为0 也就是 第一个 别的为1就好 请最短路
题解:
忘记不存在的情况了 wa了一发 ZZ
AC代码
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define LL long long#define CLR(a,b) memset(a,(b),sizeof(a))const int INF = 0x3f3f3f3f;const LL INFLL = 0x3f3f3f3f3f3f3f3f;const int N = 1e3+10;int mps[N][N]; //邻接矩阵,表示从->的距离int dis[N]; //dst[i] 从到i的距离bool vis[N]; // 标记节点是否被访问'int n, m;int s, t;void Dijkstra(){ for(int i = 1;i <= n; i++) dis[i] = mps[s][i]; dis[s] = 0; vis[s] = true; int minx, k; for(int i = 1;i <= n; i++) { minx = INF; for(int j = 1;j <= n; j++) { if(!vis[j] && minx>dis[j]) { minx = dis[j]; k = j; } } if(minx == INF) break; vis[k] = true; for(int j = 1; j <= n; j++) { if(!vis[j] && dis[j] > dis[k]+mps[k][j]) { dis[j] = dis[k]+mps[k][j]; } } }}int main(){ while(~scanf("%d%d%d",&n,&s,&t)) { CLR(vis,false); CLR(dis,0); int x, y, z; for(int i = 1;i <= n; i++) { for(int j = 1;j <= i; j++) { if(i == j) mps[i][j] = 0; else mps[i][j] = mps[j][i] = INF; } } int a, b; for(int i = 1; i <= n; i++) { scanf("%d",&a); for(int j = 0;j < a; j++) { scanf("%d",&b); if(j == 0) mps[i][b] = 0; else mps[i][b] = 1; } } Dijkstra(); if(dis[t] == INF) printf("-1\n"); else printf("%d\n",dis[t]); }return 0;}
- Poj 1847 Tram ( 最短路变形
- POJ 1847 Tram 最短路
- POJ 1847 Tram(最短路)
- POJ - 1847Tram最短路
- poj-1847 Tram 最短路
- POJ-1847 Tram( 最短路 )
- poj 1847 Tram (SPFA最短路)
- POJ 1847 Tram(floyd 最短路)
- poj-1847-Tram(最短路问题)
- POJ 1847 tram 最短路 (Flord)
- poj 1847 Tram (最短路)
- POJ 1847 Tram 简单最短路★
- POJ 1847 Tram(最短路)
- POJ 1847 Tram --set实现最短路SPFA
- poj 1847 Tram 【最短路 dijkstra + floyd + spfa】
- POJ 1847 Tram Floyd或者spfa 最短路
- (POJ 1847)Tram 简单最短路 spfa
- poj 1797 最短路变形
- RYU的REST API 获取拓扑发现结果
- 啥是广点通
- poj2342(summerIv) 树状DP水题
- 一起来点React Native——常用组件之Text
- Python解析lmdb格式mnist数据集
- Poj 1847 Tram ( 最短路变形
- 判断电机运转速度:转速要求高时,应选相电流较大、电感较小的电机,以增加功率输入。且在选择驱动器时采用较高供电电压。
- 近5年典型的的APT攻击事件
- spark demo之wordcount和K-means
- 一起来点React Native——常用组件之Image
- 【dp】递推 zoj3747
- 当Java出现No enclosing instance of type E is accessible. Must qualify the allocation with an enclosing
- Tomcat启动时卡在“INFO: Deploying web application directory ......”的解决方法
- poj2337 字典序 欧拉回路/欧拉道路