题目大意:火车从一点开到另一点,轨道上有很多岔路口,每个路口都有好几个方向,默认是第一个方向,如果要选择别的方向的话要进行一次换向操作 ,给定一个起点一个终点 ,问最少进行几次操作能够到达终点 , 如果开不到输出 -1
解题思路:转换次数作为权值,第一个路口是 0,别的是 1,求最短路
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<cmath>
#include<string.h>
#include<string>
#include<queue>
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
const int INF = 0x3f3f3f3f;
const int NINF = -INF -1;
const int MAXN = 100+5;
using namespace std;
int n, a, b;
int dis[MAXN];
bool vis[MAXN];
bool tag[MAXN][MAXN];
int map[MAXN][MAXN];
void spfa() {
queue<int> q;
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++)
dis[i] = INF;
q.push(a);
dis[a] = 0;
vis[a] = 1;
while (!q.empty()) {
int v = q.front();
q.pop();
vis[v] = false;
for (int i = 1; i <= n; i++) {
if (tag[v][i] && dis[i] > dis[v] + map[v][i]) {
dis[i] = dis[v] + map[v][i];
if (!vis[i]) {
q.push(i);
vis[i] = true;
}
}
}
}
}
int main() {
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) map[i][j] = 0;
dis[i] = INF;
}
for (int i = 1; i <= n; i++) {
int m, v;
scanf("%d", &m);
for (int j = 0; j < m; j++) {
scanf("%d", &v);
if (!j) map[i][v] = 0;
else map[i][v] = 1;
tag[i][v] = true;
}
}
spfa();
if (dis[b] >= INF)
printf("-1\n");
else printf("%d\n", dis[b]);
}
return 0;
}