Submission #11379120

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

int main()
{
	int a,b,p,q,x,y,w[100][100]={};
	char c;
	queue<pair<int, int>>Q;
	cin>>a>>b;
	cin>>p>>q;
	cin>>x>>y;
	for(int i=1;i<=a;i++)
	{
		for(int j=1;j<=b;j++)
		{
			cin>>c;
			if(c=='.')w[i][j]=0;
			else w[i][j]=-1;
		}
	}
	pair<int,int>f=make_pair(p,q);
	int dx[4]={ 0, 1,  0, -1},dy[4]={ 1, 0, -1,  0};
	w[p][q]=1;		
	Q.push(make_pair(f.first,f.second));
	while(!Q.empty())
	{
		f=make_pair(Q.front().first,Q.front().second);
		Q.pop();
		for(int i=0;i<4;i++)
		{
			if(!w[f.first+dx[i]][f.second+dy[i]])
			{
				w[f.first+dx[i]][f.second+dy[i]]=w[f.first][f.second]+1;
				Q.push(make_pair(f.first+dx[i],f.second+dy[i]));
			}
		}
	}
	cout<<w[x][y]-1<<endl;
	return 0;
}

Submission Info

Judge Result