Submission #1437737

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#define SIZE 100001
#define MOD 1000000007
#define INF 100000000
using namespace std;

int main(void){

	typedef pair <int,int> P;
	int r,c;
	int sy,sx,gy,gx;
	char meiro[50][50];
	bool flag[50][50];
    int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};

    cin >> r >> c;
	cin >> sy >> sx;
	cin >> gy >> gx;

	sx--;
	sy--;
	gx--;
	gy--;

	for (int i = 0; i < r; ++i)
	{
		for (int j = 0; j < c; ++j)
			cin >> meiro[i][j];
	}

	for (int i = 0; i < r; ++i)
	{
		for (int j = 0; j < c; ++j)
			flag[i][j] = false;
	}

	queue <P> q;
	queue <int> num;
	q.push(P(sy,sx));
	flag[sy][sx] = true;
	num.push(0);
	int count;
 
	while(!q.empty()){
		P now = q.front();
		count = num.front();
		q.pop();
		num.pop();
 
		if(now.first == gy && now.second == gx) break;
		
		for(int i = 0; i < 4 ; i++ ){
			int a = now.first + dy[i];
			int b = now.second + dx[i];
 
			if(flag[a][b] == false && meiro[a][b] == '.'){
				q.push(P(a,b));
				num.push(count + 1);
				flag[a][b] = true;
			}
		}
	}
 
    cout <<count << endl;
 
	return 0;

} 

Submission Info

Judge Result