Submission #2972315

---

Source Code Expand

#include <bits/stdc++.h>
#include <typeinfo>
#include <cxxabi.h>
#ifdef LOCAL
#include "dbgtoki.hpp"
#define DUMP(i) dump((string)TOSTRING(i), demangle(typeid(i).name()), __LINE__ , i) 
#else
#define DUMP(i)
#endif

using namespace std;
#define TOSTRING(x) #x
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(s) (s).begin(), (s).end()
#define dis distance
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase( unique(ALL(v)) , v.end());
#define pub push_back
#define sec second
#define fir first

typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector <int> > vvi;
const int EPS = 1e-9;
const int MOD = 1e9+7;
const int INF = (1 << 30);
const double PI = acos(-1);

int dx[] = {-1,0,0,1};
int dy[] = {0,-1,1,0};

typedef pair<int,int> P;
typedef pair<int,P> PP;
int R,C;
queue<PP> Q;
vector< vector<char> > VC;

void putQueue(int c,int y,int x){
	REP(i,4){
		if(y+dy[i] < 0 || y+dy[i] >= R)continue;
		if(x+dx[i] < 0 || x+dx[i] >= C)continue;
		if(VC[y+dy[i]][x+dx[i]] == '#')continue;
		Q.push(PP(c,P(y+dy[i],x+dx[i])));
		VC[y+dy[i]][x+dx[i]] = '#';
	}
}


int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cin >> R >> C;
	int sy,sx;
	cin >> sy >> sx;
	int gy,gx;
	cin >> gy >> gx;
	sy--;sx--;gy--;gx--;
	VC = vector< vector<char> > (R,vector<char>(C,'#'));
	REP(i,R)REP(j,C)cin >> VC[i][j];
	Q.push(PP(0,P(sy,sx)));
	VC[0][0] = '#';
	while(!Q.empty()){
		PP pp = Q.front();Q.pop();
		if(pp.sec.fir == gy && pp.sec.sec == gx){
			cout << pp.fir << endl;
			return 0;
		}
		DUMP(pp);
		putQueue(pp.fir+1,pp.sec.fir,pp.sec.sec);
		DUMP(Q);
	}
	return 0;
}

Submission Info

Judge Result