方格迷宫（bfs）

4943. 方格迷宫 - AcWing题库

输入

3 4 4
....
###.
....
1 1 3 1

 

输出

3

输入

3 4 1
....
###.
....
1 1 3 1

输出

8

输入

2 2 1
.#
#.
1 1 2 2

输出

-1

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <queue>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;	-- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;


typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =1e3+ 10,M = N *4,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 998244353,base= 20010;
const LL LNF=(LL) INF * INF;


int n,m,k;

//int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
int dx[]={-1,0,1,0},dy[]={0,-1,0,1};
int sx,sy,ex,ey;
char g[N][N];
int dist[N][N];

int bfs()
{
	if(sx == ex && sy == ey ) return 0;
	queue<PII>q;
	q.push({sx,sy});
	ms(dist,0x3f);
	dist[sx][sy] = 0;
	
	while(q.size())
	{
		auto t = q.front();q.pop();
		for(int i=0 ;i < 4 ;i ++ )
		{
            for(int j=1 ;j <=k ;j ++ )
			{
                int a = t.x + dx[i] * j ,b = t.y + dy[i] * j ;
if(a <1  || a > n || b < 1 || b > m || g[a][b] == '#' ) break;

					if(dist[a][b] < dist[t.x ][t.y]  + 1 )break;
//  剪枝					
// 用当前点(a,b) 来更新(t.x,t.y) 不是最优策略 往后的由(a,b)更新出来的 都不是最优策略					
                    if(dist[a][b] > dist[t.x][t.y] + 1 )
                    {
   		     			dist[a][b] = dist[t.x][t.y] + 1;
                    	if(a == ex && b == ey ) 
                    	return dist[a][b];
        				q.push({a,b});
					}
			}
				
		}
		
	}
	
	return -1 ;
	
}


inline void solve()
{
	cin >> n >> m >> k ;
	
	fu(i,1,n)
	cin >> g[i] + 1 ;
	
	cin >> sx>>sy >> ex>>ey;
	
	cout << bfs();
	
		
				 
}
signed main()
{
//  freopen("1.txt","r",stdin);
//	#define int long long 
//	init(N-1);
    // ios
//	cout << fixed<<setprecision(2);
    int t=1;
    // cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}