Submission #162409

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.h>
#include <complex>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef vector<LL> VLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define MT(a,b,c) MP(a, MP(b, c))

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define MOD 1000000007

char board[55][55];
int dist[55][55];
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};


int main(){
	int r,c,sy,sx,gy,gx;
	cin>>r>>c>>sy>>sx>>gy>>gx;
	REP(i,r)cin>>board[i];
	memset(dist, 0x7f, sizeof(dist));
	queue<PII> q;
	q.push(MP(sy-1, sx-1));
	dist[sy-1][sx-1]=0;
	while(!q.empty()){
		PII tmp=q.front();
		if(tmp.first==gy-1 && tmp.second==gx-1){
			cout << dist[tmp.first][tmp.second] << endl;
			return 0;
		}
		q.pop();
		REP(i,4){
			if(board[tmp.first+dy[i]][tmp.second+dx[i]]!='#'){
				dist[tmp.first+dy[i]][tmp.second+dx[i]]=dist[tmp.first][tmp.second]+1;
				board[tmp.first+dy[i]][tmp.second+dx[i]]='#';
				q.push(MP(tmp.first+dy[i],tmp.second+dx[i]));
			}
		}
	}
	return 0;
}

Submission Info

Judge Result