U425647题解

题解

这题是bfs模版题

方法一bfs

代码

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1010;
int n,m,a[N][N];
struct node
{
	int x,y;
};
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
bool vis[N][N];
int d[N][N];
bool check(int x,int y)
{
	return x >= 1 && x <= n && y >= 1 && y <= m && d[x][y] == -1;
}
signed main()
{
	cin >> n >> m;
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= m;j++)
		{
			cin >> a[i][j];
		}
	}
	memset(d,-1,sizeof(d));
	queue<node> q;
	q.push((node){1,1});
	vis[1][1] = true;
	d[1][1] = 0;
	while(!q.empty())
	{
		node u = q.front();
		q.pop();
		int x = u.x,y = u.y;
		for(int i = 0;i < 4;i++)
		{
			int nx = x + dx[i] * a[x][y],ny = y + dy[i] * a[x][y];
			if(!check(nx,ny))	continue;
			q.push((node){nx,ny});
			d[nx][ny] = d[x][y] + 1;
			if(nx == n && ny == m)
			{
				cout << d[n][m] << endl;
				return 0;
			}
		}
	}
	cout << "No Solution" << endl;
    return 0;
}