poj1847 Dijkstra
来源:互联网 发布:淘宝退货垫付运费规则 编辑:程序博客网 时间:2024/05/03 08:40
Tram
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13393 Accepted: 4924
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.
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.
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
懂题意:就是有n个交叉点,就当做有n个点就行,然后这些点和其他点有些路径,每个点是一个开关,开关只能有一个方向走一条路,而第一个数就是默认的开关指向,不用旋转。就是默认的指向实际上只需要旋转0次,而其他路径只需要旋转1次,无论是哪条,只需1次!!! 不要以为,第二个1次,第3个2次。
题目给的实例
3 2 1 //有3个开关点,计算从第二个到第一个最少需要旋转几次
2 2 3//第1个开关可以通向2 和3 ,通向2不需要旋转,通向3需要旋转1次
2 3 1//第2个开关可以通向3 和1, 通向3不需要旋转,通向1需要旋转1次
2 1 2//第3个开关可以通向1 和2, 通向1不需要旋转,通向2需要旋转1次
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int INF=0x3f3f3f3f;int map[200][200];int flag[200],path[200];int n,a,b;int find_it(){ int pos=-1; int min=INF; for(int i=1;i<=n;i++){ if(!flag[i]&&path[i]<min){ pos=i; min=path[i]; } } return pos;}void Dijkstra(){ for(int i=1;i<=n;i++){ path[i]=INF; flag[i]=0; } path[a]=0; int p=find_it(); while(p!=-1) { flag[p]=1; for(int i=1;i<=n;i++){ if(!flag[i]&&path[p]+map[p][i]<path[i]) path[i]=path[p]+map[p][i]; } p=find_it(); }}int main(){ int num,t; //freopen("in.txt","r",stdin); while(scanf("%d%d%d",&n,&a,&b)!=EOF) { for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) map[i][j]=INF; for(int i=1;i<=n;i++){ scanf("%d",&num); for(int j=1;j<=num;j++){ scanf("%d",&t); if(j==1) map[i][t]=0; else map[i][t]=1; } } Dijkstra(); if(path[b]==INF) printf("-1\n"); else printf("%d\n",path[b]); } return 0;}
0 0
- poj1847 dijkstra
- poj1847 Dijkstra
- POJ1847 dijkstra 水题
- poj1847 dijkstra板子
- poj1847-单源路径dijkstra算法
- POJ1847 Tram最短路径 Dijkstra
- poj1847——Tram(dijkstra)
- poj1847
- poj1847--探索dijkstra可否判最短路存在
- poj1847 - Tram (最短路径问题) (Dijkstra)
- POJ1847 Tram ACM解题报告(dijkstra求最短路)
- POJ1847:Tram
- POJ1847---Tram
- [poj1847] Tram
- poj1847 Tram
- POJ1847 floyd求最短路径
- Tram(poj1847,floyd)
- poj1847 Tram(最短路)
- 高并发解决方案--负载均衡
- STL容器函数资料
- hls之m3u8、ts流格式详解
- TCP粘包问题
- 数据结构实验之栈:行编辑器
- poj1847 Dijkstra
- hadoop 配置文件说明
- MySQL中两种备份方法的优缺点
- 坚持努力奋斗学习(有终身受益的重点)
- 标准栈之进制转换
- Openstack中Nova组件介绍
- 在Windows 8.1下 安装基于Python 3.5.2的 Scrapy 框架 !已安装完成
- HTTPClient4.3的典型小例子
- Tomcat -- 源码分析NO1(模拟简易版本servlet容器)