Language: C++

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>

using namespace std;
using namespace __gnu_pbds;
long long power(long long x, long long y, long long mood) {
	if (y == 0)
		return 1;
	long long ret = power(x, y >> 1, mood) % mood;
	if (y % 2 == 0)
		return (ret * ret) % mood;
	else
		return (x * (ret * ret % mood)) % mood;
}
const double Eps = (1e-9);
int dcmp(double x, double y) {
	return fabs(x - y) <= Eps ? 0 : x < y ? -1 : 1;
}
typedef tree<int, null_type, less<int>, rb_tree_tag,
		tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
		tree_order_statistics_node_update> ordered_setpair;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<pair<int, int> > vii;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef pair<int, int> pii;
#define mii map <int, int>
#define mll map <ll, ll>
#define pii pair <int, int>
#define pll pair <ll, ll>
#define vi vector <int>
#define vd vector <double>
#define vll vector <ll>
#define sll set <ll>
#define spii set <pii>
#define vpii vector <pair <int,int> >
#define vpll vector <pair <long long,long long> >
#define vvi vector <vector <int> >
#define vvpii vector <vector <pii > >
#define sfi1(v) scanf("%d",&v)
#define sfi2(v1,v2) scanf("%d %d",&v1,&v2)
#define sfi3(v1,v2,v3) scanf("%d %d %d",&v1,&v2,&v3)
#define sfll1(v) scanf("%I64d",&v);
#define sfll2(v1,v2) scanf("%I64d %I64d",&v1,&v2)
#define sfll3(v1,v2,v3) scanf("%I64d %I64d %I64d",&v1,&v2,&v3)
#define min3(a,b,c)     min(a,min(b,c))
#define max3(a,b,c)     max(a,max(b,c))
#define min4(a,b,c,d)   min(a,min(b,min(c,d)))
#define max4(a,b,c,d)   max(a,max(b,max(c,d)))
#define el	'\n'
#define lp(i,n) for(int i = 0;i < int(n);i++)
#define lp1(i,n) for(int i = 1;i <= int(n);i++)
#define rlp(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rng(i,a,b) for(int i = int(a);i <= int(b);i++)
#define mp(x,y)  	make_pair((x),(y))
#define pb(x)    	push_back((x))
#define pob()    	pop_back()
#define all(v)  	((v).begin()),((v).end())
#define sz(x)  		((int) (x).size())
#define bits(a) 	__builtin_popcountll(a)
#define fr first
#define sc second
#define pii pair<int, int>
#define sortva(v) sort(all(v))
#define sortvd(v) sort(v.rbegin(),v.rend())
#define sortaa(a,n) sort(a,a+n)
#define sortad(a,n) sort(a,a+n),reverse(a,a+n)
#define SS stringstream
#define ll long long
#define clr(x, y) memset(x, y, sizeof(x))
#define foreach(it,x) for(__typeof__((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define read freopen("input.in", "rt", stdin);
#define write freopen("output.in", "wt", stdout);
#define fastIO cout << fixed << setprecision(7), ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
const long long key1 = (31);
const long long key2 = 59;
int dx[] = { 0, 1, 0, -1, 1, -1, 1, -1 };
int dy[] = { 1, 0, -1, 0, -1, 1, 1, -1 };
int kx[] = { 2, 2, 1, -1, -2, -2, 1, -1 };
int ky[] = { 1, -1, 2, 2, 1, -1, -2, -2 };
int gcd(int a, int b) {
	if (a == 0)
		return b;
	return gcd(b % a, a);
}
ll lcm(ll a, ll b) {
	return (a / gcd(a, b)) * b;
}
int setBit(int num, int idx, int val) {
	return val ? (num | (1 << idx)) : (num & (~(1 << idx)));
}
int getBit(int num, int idx) {
	return ((num >> idx) & 1) == 1;
}
int const N = 1e3+5 , mod = 1e9 + 7, oo = 1e9 + 10;
//-------------------------------------------------------------------------------------
int vis[N][N];
string arr[N];
int tarx,tary;
int n,m;
bool valid(int x,int y){
return (x>=0&&x<n&&y>=0&&y<m&&arr[x][y]=='.'&&cnt<vis[x][y]);
}
int bfs(int x,int y){
deque<pair<int,pii>>q;
q.push_front(mp(0,mp(x,y)));
while(!q.empty()){
	pair<int,pii>xx=q.front();
	q.pop_front();
	int cnt=xx.fr;
	int x=xx.sc.fr;
	int y=xx.sc.sc;
	vis[x][y]=cnt;
	if (x==tarx&&y==tary)return cnt;
	lp(i,4){
	int nx=x+dx[i];
	int ny=y+dy[i];
	if (valid(nx,ny,cnt))q.push_front(mp(cnt,mp(nx,ny)));
	}



}
return -1;
}
int main()
{


	int x,y;
	cin>>n>>m;
	cin>>x>>y;
	cin>>tarx>>tary;
	x--;
	y--;
	tarx--;
	tary--;
	lp(i,n)cin>>arr[i];
	deque <pair<int,pii>>q;
	 pair<int,pii>p;
	p.fr=0;
	p.sc.fr=x;
	p.sc.sc=y;
	q.push_back(p);
	while(!q.empty()){
		p=q.front();
		q.pop_front();
		int timex=p.fr;
		int curx=p.sc.fr;
		int cury=p.sc.sc;
		vis[curx][cury]=1;
		if (curx==tarx&&cury==tary)return cout<<timex,0;
		for (int i=0;i<4;i++){
			int nx=dx[i]+curx;
			int ny=dy[i]+cury;
			if (nx>=0&&nx<n&&ny>=0&&ny<m&&!vis[nx][ny]&&arr[nx][ny]!='#'){
				q.push_front({timex,{nx,ny}});
			}
		}
		for (int i=curx-2;i<=curx+2;i++){
		for (int j=cury-2;j<=cury+2;j++){
			int nx=i;
			int ny=j;
			if (nx>=0&&nx<n&&ny>=0&&ny<m&&!vis[nx][ny]&&arr[nx][ny]!='#'){
				q.push_back({timex+1,{nx,ny}});
			}
		}
	}

	}
	cout<<-1;




/**/







	return 0;
}





Compiler output:
a.cc:69:9: warning: "pii" redefined
   69 | #define pii pair<int, int>
      |         ^~~
a.cc:35:9: note: this is the location of the previous definition
   35 | #define pii pair <int, int>
      |         ^~~
a.cc: In function 'bool valid(int, int)':
a.cc:108:47: error: 'cnt' was not declared in this scope; did you mean 'int'?
  108 | return (x>=0&&x<n&&y>=0&&y<m&&arr[x][y]=='.'&&cnt<vis[x][y]);
      |                                               ^~~
      |                                               int
a.cc: In function 'int bfs(int, int)':
a.cc:124:18: error: too many arguments to function 'bool valid(int, int)'
  124 |         if (valid(nx,ny,cnt))q.push_front(mp(cnt,mp(nx,ny)));
      |             ~~~~~^~~~~~~~~~~
a.cc:107:6: note: declared here
  107 | bool valid(int x,int y){
      |      ^~~~~