Submission #1202207

---

Source Code Expand

#define MYDEBUG
#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <math.h>
#include <queue>

#ifdef MYDEBUG
#define debug(x) cout<<#x<<": "<<x<<endl
#else
#define debug(x)
#endif
#define ll long long
#define ull unsigned long long
#define eps 1e-14
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  size_t last = v.size() - 1;
  for (size_t i = 0; i < v.size(); ++i) {
    out << v[i];
    if (i != last)
      out << ",";
  }
  out << "]";
  return out;
}

int di[] = {-1,0,1,0};
int dj[] = {0,1,0,-1};
int main() {
	queue<int> qi,qj;
	int r,c;
	cin >> r >> c;
	int si,sj,gi,gj;
	cin >> si >> sj >> gi >> gj;
	char grid[r+1][c+1];
	int cnt[r+1][c+1];
	for(int i=1; i<=r; ++i){
		string s;
		cin >> s;
		for(int j=1; j<=c; ++j){
			grid[i][j] = s.at(j-1);
			cnt[i][j]=0;
		}
	}
	qi.push(si);
	qj.push(sj);
	while(!qi.empty()){
		int ni = qi.front(), nj = qj.front();
		qi.pop(); qj.pop();
		for(int k=0; k<4; ++k){
			int mvi = ni+di[k], mvj = nj+dj[k];
			if(1<=mvi&&mvi<=r&&1<=mvj&&mvj<=c
			&&grid[mvi][mvj]=='.'&&cnt[mvi][mvj]==0){
				cnt[mvi][mvj]=cnt[ni][nj]+1;
				qi.push(mvi); qj.push(mvj);
			}
		}
	}
	cout << cnt[gi][gj] << endl;
}

Submission Info

Judge Result