Submission #162594

---

Source Code Expand

#include <iostream>
using namespace std;

int map[51][51];
bool next[51][51];

int serch(int y,int x){
	int min=9999999;
	for(int i=-1;i<=1;i+=2){
		if(map[y+i][x] <= min && map[y+i][x] >= 0){
			min = map[y+i][x];
		}
		if(map[y+i][x] == -1){
			map[y+i][x] = -4;
		}
		if(map[y][x+i] <= min && map[y][x+i] >= 0){
			min = map[y][x+i];
		}
		if(map[y][x+i] == -1){
			map[y][x+i] = -4;
		}
	}
	if(min == 9999999){
		min = -1;
	}
	if(map[y-1][x] == -2 && map[y+1][x] == -2 && map[y][x-1] == -2 && map[y][x+1] == -2){
		min = -3;
	}
	return min;
}

int main() {
	// your code goes here
	int r,c;
	int sx,sy;
	int gx,gy;
	char s;
	bool check;
	int buf;
	
	cin >> r >> c;
	cin >> sy >> sx;
	cin >> gy >> gx;
	
	for(int i=1;i<=r;i++){
		for(int j=1;j<=c;j++){
			cin >> s;
			if(s=='#'){
				map[i][j] = -2;
			}else{
				map[i][j] = -1;
			}
			//cout << map[i][j];
		}
		//cout << endl;
	}
	
	map[sy][sx] = 0;
	
	if(map[sy-1][sx] == -1){
		map[sy-1][sx] = -4;
	}
	if(map[sy][sx-1] == -1){
		map[sy][sx-1] = -4;
	}
	if(map[sy+1][sx] == -1){
		map[sy+1][sx] = -4;
	}
	if(map[sy][sx+1] == -1){
		map[sy][sx+1] = -4;
	}
	
	while(1){
		check = true;
		
		for(int i=1;i<=r;i++){
			for(int j=1;j<=c;j++){
				if(map[i][j] == -4){
					buf = serch(i,j);
					if(buf > -1){
						map[i][j] = buf+1;
					}else{
						map[i][j] = -1;
					}
					if(buf == -3){
						map[i][j] = -3;
					}
					check = false;
				}
			}
		}
		
		if(check){
			break;
		}
	}
	
	/*for(int i=0;i<r;i++){
		for(int j=0;j<c;j++){
			if(map[i][j] == -2){
				//cout << '*';
			}else{
				//cout << map[i][j];
			}
		}
		//cout << endl;
	}*/
	
	cout << map[gy][gx] << endl;
	
	return 0;
}

Submission Info

Judge Result