Submission #162590

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
#endif

using namespace std;


typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).rend()
#define PB push_back


#define MOD 1000000009LL
#define EPS 1e-8



int main(){
	int h, w, sy, sx, gy, gx;
	cin >> h >> w >> sy >> sx >> gy >> gx;
	--sy;
	--sx;
	--gy;
	--gx;
	vector<string> c(h);
	for(int i = 0; i < h; ++i){
		cin >> c[i];
	}
if(!cin)throw 0;
	
	int dd[] = {-1, 0, 1, 0, -1};
	
	queue<int> q;
	q.push(sy << 8 | sx);
	q.push(-1);
	int tm = 0;
	while(1){
		if(q.front() == -1){
			q.pop();
			q.push(-1);
			++tm;
		}
		else{
			int y = q.front() >> 8, x = q.front() & 255;
			q.pop();
			if(y == gy && x == gx){
				break;
			}
			
			for(int i = 0; i < 4; ++i){
				int ny = y + dd[i], nx = x + dd[i + 1];
				if(c[ny][nx] == '.'){
					c[ny][nx] = '_';
					q.push(ny << 8 | nx);
				}
			}
		}
	}
	
	cout << tm << endl;
	
}

Submission Info

Judge Result