Submission #1359042

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <bitset>


typedef long long ll;
#define fi first
#define se second
const ll mod = 1000000007;
//              123456789

using namespace std;

///////////////////////////////////////////////
//
//
///////////////////////////////////////////////

////////////////////////////////////////////////
////////////////////////////////////////////////

int R;
int C;
int sy;
int sx;
int gy;
int gx;

string S[50];

int dist[50][50];

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

pair<int, int >Q[2500];

int main(){
	
	cin>>R>>C;
	cin>>sy>>sx;
	cin>>gy>>gx;
	
	sy--;
	sx--;
	gy--;
	gx--;
	
	int i;
	int j;
	int x;
	int y;
	int Push = 0;
	int Pop = 0;
	
	for( i = 0; i < R; i++ ){
		cin>>S[i];
	}
	
	fill(dist[0], dist[50], -1);
	
	for( i = 0; i < R; i++ ){
	 	for( j = 0; j < C; j++ ){
	 		if( S[i][j] == '.' ) dist[i][j] = mod;
		}
	}
	
	dist[sy][sx] = 0;
	Q[Push].fi = sy;
	Q[Push].se = sx;
	Push++;
	
	while( Pop < Push ){
		//ゴールについたらおしまい
		if( Q[Pop].fi == gy && Q[Pop].se == gx ) break;
		
		for( i = 0; i < 4; i++ ){
			y = Q[Pop].fi+dy[i];
			x = Q[Pop].se+dx[i];
			if( dist[y][x] != -1 ){
				if( dist[y][x] > dist[Q[Pop].fi][Q[Pop].se]+1 ){
					dist[y][x] = dist[Q[Pop].fi][Q[Pop].se]+1;
					Q[Push].fi = y;
					Q[Push].se = x;
					Push++;
				}
			}
		}
		Pop++;
	}
	
	/*
	for( i = 0; i < R; i++ ){
		for( j = 0; j < C; j++ ){
			if( j ) printf(" ");
			printf("%d", dist[i][j]);
		}
		puts("");
	}
	*/
	
	cout<<dist[gy][gx]<<endl;
	
	return 0;
}

Submission Info

Judge Result