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

Sample Output

0

题解：简单的最短路。

迪杰斯特拉：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>

using namespace std;

const int INF= 0x3fffffff;

int map[120][120];
bool visited[120];
int d[120];

void prim(int n,int s)
{
	memset(visited,false,sizeof(visited));
	for(int i = 1;i <= n;i++)
	{
		d[i] = map[s][i];
	}
	visited[s] = true;
	for(int i = 1;i < n;i++)
	{
		int min = INF;
		int k;
		for(int j = 1;j <= n;j++)
		{
			if(!visited[j] && min > d[j])
			{
				min = d[j];
				k = j;
			}
		}
		
		if(min == INF)
		{
			break;
		}
		visited[k] = true;
		for(int j = 1;j <= n;j++)
		{
			if(!visited[j] && d[j] > d[k] + map[k][j])
			{
				d[j] = d[k] + map[k][j];
			}
		}
	}
}

int main()
{
	int N,A,B;
	while(scanf("%d%d%d",&N,&A,&B) != EOF)
	{
		int n,num;
		for(int i = 1;i <= N;i++)
		{
			for(int j = 1;j <= N;j++)
			{
				if(i == j)
				{
					map[i][j] = 0;
				}
				else
				{
					map[i][j] = INF;
				}
			}
		}
		for(int i = 1;i <= N;i++)
		{
			scanf("%d",&n);
			for(int j = 0;j < n;j++)
			{
				scanf("%d",&num);
				if(j == 0)
				{
					map[i][num] = 0;
				}
				else
				{
					map[i][num] = 1;
				}	
			}
		}
		
		prim(N,A);
		if(d[B] != INF)
		{
			printf("%d\n",d[B]);
		}
		else
		{
			printf("-1\n");
		}
	}
	
	return 0;
}

SPFA：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>

using namespace std;

const int INF= 0x3fffffff;

int map[120][120];
bool visited[120];
int d[120];

void spfa(int n,int s)
{
	memset(visited,false,sizeof(visited));
	for(int i = 1;i <= n;i++)
	{
		d[i] = INF;
	}
	queue<int> q;
	d[s] = 0;
	q.push(s);
	visited[s] = true;
	while(!q.empty())
	{
		int x = q.front();
		q.pop();
		visited[x] = false;
		for(int i = 1;i <= n;i++)
		{
			if(d[i] > d[x] + map[x][i])
			{
				d[i] = d[x] + map[x][i];
				if(!visited[i])
				{
					q.push(i);
					visited[i] = true;
				}
			}
		}
	}
}

int main()
{
	int N,A,B;
	while(scanf("%d%d%d",&N,&A,&B) != EOF)
	{
		int n,num;
		for(int i = 1;i <= N;i++)
		{
			for(int j = 1;j <= N;j++)
			{
				if(i == j)
				{
					map[i][j] = 0;
				}
				else
				{
					map[i][j] = INF;
				}
			}
		}
		for(int i = 1;i <= N;i++)
		{
			scanf("%d",&n);
			for(int j = 0;j < n;j++)
			{
				scanf("%d",&num);
				if(j == 0)
				{
					map[i][num] = 0;
				}
				else
				{
					map[i][num] = 1;
				}	
			}
		}
		
		spfa(N,A);
		if(d[B] != INF)
		{
			printf("%d\n",d[B]);
		}
		else
		{
			printf("-1\n");
		}
	}
	
	return 0;
}