poj 1847 最短路 floyd
来源:互联网 发布:上海索昂软件 编辑:程序博客网 时间:2024/05/21 20:21
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
Source
Croatia OI 2002 Regional - Juniors
这道题其实很简单,关键是读懂题意:就是有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次
。。。。。。。。。。。。。。。
太懒了吧,下面我只写了Floyd的代码,4种最短路算法都可以做:
#include <iostream>#include <stdio.h>#include <math.h>#include <string.h>#include <algorithm>using namespace std;#define INF 0x3f3f3f3f#define N 110int n,a,b;int maps[N][N];void init(){ int i,j; for(i=0;i<=n;i++) { for(j=0;j<=n;j++) { maps[i][j]=maps[j][i]=(i==j)?0:INF; } }}void floyd(){ int i,j,k; for(k=1;k<=n;k++) { for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { if(maps[i][k]+maps[k][j]<maps[i][j]) maps[i][j]=maps[i][k]+maps[k][j]; } } } if(maps[a][b]>=INF) printf("-1\n"); else printf("%d\n",maps[a][b]);}int main(){ int i,j,m,x; while(scanf("%d%d%d",&n,&a,&b)!=EOF) { init(); for(i=1;i<=n;i++) { scanf("%d",&m); for(j=1;j<=m;j++) { scanf("%d",&x); if(j==1) maps[i][x]=0; else maps[i][x]=1; } } floyd(); } return 0;}
0 0
- poj 1847 最短路 floyd
- POJ 1847 Tram(floyd 最短路)
- POJ 3165 最短路 floyd
- POJ 2253 floyd 最短路
- poj 2253 floyd最短路!!!
- POJ 1125 最短路 FLOYD
- poj 1847 Tram 【最短路 dijkstra + floyd + spfa】
- POJ 1847 Tram Floyd或者spfa 最短路
- poj 2253 Frogger (最短路Floyd)
- poj 2570 Fiber Network(最短路+Floyd)
- poj 2263 Heavy Cargo(最短路+floyd)
- POJ 3613 Cow Relays Floyd最短路
- POJ 1125 Stockbroker Grapevine(最短路&Floyd)
- [poj 1125]Stockbroker Grapevine[Floyd最短路]
- POJ 2253 Frogger(最短路 Floyd)
- POJ 2240 Arbitrage(最短路 Floyd)
- poj 1603 Risk(最短路floyd)
- POJ 1125 Stockbroker Grapevine (Floyd最短路)
- Linux下的软件源代码安装
- 字符串-644 Immediate Decodability
- 小结:c#Constructor构造函数注入
- OpenLayers3入门篇-点在线上的运动
- linux 操作系统中检查特定用户上次登录的时间lastlog命令的使用
- poj 1847 最短路 floyd
- android NDK JNI so文件的制作和使用
- C++ OO Programming (1)
- 视频驱动V4L2子系统驱动架构 - 驱动框架
- 猜数游戏(JAVA)
- Android从1.0到 6.0各版本的差别
- sdfasddddddddddddd
- 学年末总结
- linux 操作系统中显示数据包到主机的路径traceroute命令的使用