D - Tram

D - Tram

题目描述
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.

输入描述
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.

输出描述
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”.

题意
根据题目描述，所有交叉路口的开关指向列出的第一个路口编号。如果火车直接经过该路口到达默认指向的第一个交叉路口，则不用掰开关，次数不增加。经过该路口到达其它路口，则需要扳动一次开关。就是一个列车从A到B，但是铁路是多向的，就像多掷开关一样，走原来的方向不用改变铁路，走其他方向就要改变一次，问这过程中最少改变的次数。

思路
因此，建立一个图，顶点编号 1 到 N 分别对应交叉路口 1 到 N。第 i 个路口可以通向 Ki 个其它路口，开关指向第一个路口 j，则 i 到 j 有一条权为 0 的边。i 到 剩下的路口各有 1 条权为 1 的边。如果无法从路口 a 到达路口 b，输出 -1。

代码
floyd

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 105, INF = 0x3f3f3f3f;
int n, a, b, g[N][N], k, v;
void floyd() {
	for (int k = 1; k <= n; k++) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
      			g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
			}
		}
	}
}
int main() {
	memset(g, 0x3f, sizeof(g));//初始化
	scanf("%d%d%d", &n, &a, &b);
	for (int u = 1; u <= n; u++) {
		scanf("%d", &k);
		for (int j = 1; j <= k; j++) {
			scanf("%d", &v);
			if (j == 1) g[u][v] = 0;//第一个输入的数字为行驶方向，边的权值为0
			else g[u][v] = 1;//其他后输入的数字，边的权值均设为1
		}
	}
	floyd();
	if (g[a][b] == INF) printf("-1");
	else printf("%d", g[a][b]);
	return 0;
}