这道题可用DP解出
DP万能
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
long long dis[100100];
int n,m,k,a[2010][2010];
void dp()
{
memset(dis,0x3f,sizeof(dis));
long long f=1;
dis[1]=1;
while(f!=0)
{
f=0;
for(int i=1;i<=m;i++)
{
long long minn=0x3ffffff;
long long bz=0x3fffffff;
for(int j=1;j<=k;j++)
if(dis[a[i][j]]<minn)
minn=dis[a[i][j]];
if(minn==bz)continue;
for(int j=1; j<=k; j++)
if(dis[a[i][j]]>minn+1)
dis[a[i][j]]=minn+1,f=1;
}
}
}
int main()
{
freopen("trans.in","r",stdin);
freopen("trans.out","w",stdout);
cin>>n>>k>>m;
for(int i=1; i<=m; i++)
for(int j=1; j<=k; j++)
cin>>a[i][j];
dp();
if(dis[n]==dis[0])
cout<<-1;
else
cout<<dis[n];
}