Submission #691657

---

Source Code Expand

using System;
using System.Collections.Generic;
class c{
    public static void Main(){
	string[] input = Console.ReadLine().Split(' ');
	int r = int.Parse(input[0]);
	int c = int.Parse(input[1]);
	input = Console.ReadLine().Split(' ');
	int s_y = int.Parse(input[0])-1;
	int s_x = int.Parse(input[1])-1;
	input = Console.ReadLine().Split(' ');
	int g_y = int.Parse(input[0])-1;
	int g_x = int.Parse(input[1])-1;
 
	char[,] maze = new char[r,c];
 
	Queue<point> q = new  Queue<point>();
	int[,] ans = new int[r,c];
	
	for(int i = 0;i<r;i++){
	    string tmp = Console.ReadLine();
	    for(int j = 0;j<c;j++){
		maze[i,j] = tmp[j];
		if(maze[i,j] == '#')
		    ans[i,j] = -1;
	    }
	}
 
	int[] dx = {0,-1,0,1};
	int[] dy = {-1,0,1,0};
 
	q.Enqueue(new point(s_x,s_y));
	while(q.Count > 0){
	    point tmp = q.Dequeue();
	    int x = tmp.x;
	    int y = tmp.y;
 
	    if(x == g_x&&y == g_y)
		break;
 
	    for(int i = 0;i<4;i++){
		int tmp_x = x+dx[i];
		int tmp_y = y+dy[i];
		if(ans[tmp_y,tmp_x] != -1&&ans[tmp_y,tmp_x] <= 0){
		    q.Enqueue(new point(tmp_x,tmp_y));
		    ans[tmp_y,tmp_x] = ans[y,x] + 1;
		}
		
	    }
	}
 
	
	    
	
	//q.Enqueue(new point(1,1));
	//point a = q.Dequeue();
	//Console.WriteLine("x:{0} y:{1}",a.x,a.y);
	/*
	for(int i = 0;i<r;i++){
	    for(int j = 0;j<c;j++){
		Console.Write("{0} ",ans[i,j]);
	    }
	    Console.WriteLine();
	}
	*/
	Console.WriteLine(ans[g_y,g_x]);
    }
}
class point{
    public int x;
    public int y;
    public point(int a,int b){
	x = a;
	y = b;
    }
}

Submission Info

Judge Result