poj1847Tram （最短路）

题意： 有n个点，每个点是一个开关，开关只能有一个方向走一条路，而第一个数就是默认的开关指向，不用旋转。 而其他路径只需要旋转1次，无论是哪条，只需1次。

题目给的实例

3 2 1 //表示有3个开关点，计算从第二个到第一个最少需要旋转几次

2 2 3//第1个开关可以通向2 和3 ，通向2不需要旋转，通向3需要旋转1次

2 3 1//第2个开关可以通向3 和1， 通向3不需要旋转，通向1需要旋转1次

思路： 把题目读懂就很好做了..直接建图，由于n范围比较小，所以直接floyd就行了

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 100000
#define LL long long
int cas=1,T;
const int INF = 1<<25;
int mapp[105][105];
int n,m;
int main()
{
    int a,b;
	while (scanf("%d%d%d",&n,&a,&b)!=EOF)
	{
		for (int i = 1;i<=n;i++)
			for (int j = 1;j<=n;j++)
				if (i==j)
					mapp[i][j]=0;
		        else
					mapp[i][j]=INF;
		for (int i = 1;i<=n;i++)
		{
			scanf("%d",&m);
			for (int j = 1;j<=m;j++)
			{
				int u;
				scanf("%d",&u);
				if (j==1)
					mapp[i][u]=0;
				else
					mapp[i][u]=1;
			}
		}

		for (int k = 1;k<=n;k++)
			for (int i = 1;i<=n;i++)
				for (int j = 1;j<=n;j++)
					if (mapp[i][j] > mapp[i][k]+mapp[k][j])
						mapp[i][j] = mapp[i][k]+mapp[k][j];
		if (mapp[a][b] >=INF)
			printf("-1\n");
		else
			printf("%d\n",mapp[a][b]);
	}

	//freopen("in","r",stdin);
	//scanf("%d",&T);
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}

题目

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 1
2 2 3
2 3 1
2 1 2

Sample Output

0