Submission #162119

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>

using namespace std;

using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VS = vector<string>;
using SS = stringstream;
using PII = pair<int,int>;
using VPII = vector< pair<int,int> >;
template < typename T = int > using VT = vector<T>;
template < typename T = int > using VVT = VT< VT<T> >;
template < typename T = int > using LIM = numeric_limits<T>;

template < typename T > inline T fromString( const string &s ){ T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ){ ostringstream oss; oss << a; return oss.str(); };

#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) (c).begin(), (c).end()
#define AALL( a, t ) (t*)a, (t*)a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) (c).begin(), (c).begin() + p, (c).end()

#define PB( n ) push_back( n )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )

#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

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

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int h, w, sy, sx, gy, gx;
	cin >> h >> w >> sy >> sx >> gy >> gx;

	VS board( h );
	FOR( row, board )
	{
		cin >> row;
	}

	queue<PII> que;
	que.push( MP( sy - 1, sx - 1 ) );

	VVI distances( h, VI( w, LIM<>::max() ) );
	distances[ sy - 1 ][ sx - 1 ] = 0;

	while ( !que.empty() )
	{
		const PII cur = que.front();
		que.pop();

		REP( d, 0, 4 )
		{
			const PII next( cur.fst + dy[d], cur.snd + dx[d] );

			if ( board[ next.fst ][ next.snd ] == '.' && distances[ cur.fst ][ cur.snd ] + 1 < distances[ next.fst ][ next.snd ] )
			{
				distances[ next.fst ][ next.snd ] = distances[ cur.fst ][ cur.snd ] + 1;
				que.push( next );
			}
		}
	}

	cout << distances[ gy - 1 ][ gx - 1 ] << endl;

	return 0;
}

Submission Info

Judge Result