Submission #162813

---

Source Code Expand

#include <iostream>
#include <string>
#include <queue>
#include <utility>
using namespace std;
struct P{
  int x,y,d;
  P(int a,int b,int c) : x(a),y(b),d(c) {}
};
int main( void )
{
  int R,C,sy,sx,gy,gx;
  queue<P> q;
  string m[50];
  cin >> R >> C >> sy >> sx >> gy >> gx;
  sy--; sx--; gy--; gx--;
  for( int i=0; i<R; i++ ) cin >> m[i];
  q.push( P(sx,sy,0) );
  m[sy][sx] = '#';
  while( !q.empty() ){
    int x = q.front().x;
    int y = q.front().y;
    int d = q.front().d;
    //cout << x << "," << y << "," << d << endl;
    q.pop();
    if( x == gx && y == gy ){
      cout << d << endl;
      return 0;
    }
    d++;
    if( x > 0   && m[y][x-1] != '#' ){ q.push( P(x-1,y,d) ); m[y][x-1] = '#'; }
    if( x < C-1 && m[y][x+1] != '#' ){ q.push( P(x+1,y,d) ); m[y][x+1] = '#'; }
    if( y > 0   && m[y-1][x] != '#' ){ q.push( P(x,y-1,d) ); m[y-1][x] = '#'; }
    if( y < R-1 && m[y+1][x] != '#' ){ q.push( P(x,y+1,d) ); m[y+1][x] = '#'; }
  }
  cout << "到達できなかった(´・ω・｀)" << endl;
  return 0;
}

Submission Info

Judge Result