Wishare A题

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<map>
#include<bitset>
#include<set>
#define LL long long
#define ULL unsigned long long
#define N 200100
#define M 1010
#define MOD 1000000007
#define FOR(i,l,r) for (int i = (l); i <= (r); i ++)
#define CLR(a,x) memset(a,x,sizeof(a))
#define INF 0x3f3f3f3f
#define ALL(x) x.begin(),x.end()
#define pb push_back
#define X first
#define Y second
using namespace std;
char mp[M][M];
int n,m,k;
int d[M][M], vis[M][M];
int mx[] = {0,0,1,-1},my[] = {1,-1,0,0};
typedef pair<int,int> pii;
pii q[N];

int main()
{
	scanf("%d%d%d",&n,&m,&k);
	FOR(i,1,n) scanf("%s",mp[i] + 1);
	int x1,y1,x2,y2;
	scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
	memset(d,-1,sizeof(d));
	d[x1][y1] = 0;
	int front = 1,rear = 1;
	q[1] = pii(x1,y1);
	vis[x1][y1] = (1 << 4) - 1;
	while (front <= rear)
    {
		pii u = q[front ++];
		int x = u.X, y = u.Y;
		if (x == x2 && y == y2) break;
		for (int i = 0; i < 4; i ++)
            for (int j = 1; j <= k; j ++)
            {
                int nx = x + j * mx[i];
                int ny = y + j * my[i];
                if (nx < 1 || nx > n || ny < 1 || ny > m || mp[nx][ny] == '#' || vis[nx][ny] & (1 << i)) break;       //vis[nx][ny]
                if (d[nx][ny] == -1)
                {
                    d[nx][ny] = d[x][y] + 1;
                    q[++ rear] = pii(nx, ny);
                }
                vis[nx][ny] |= 1 << i;
                //vis[nx][ny] = 1;
            }
	}
	printf("%d\n",d[x2][y2]);
}