結果

問題 No.20 砂漠のオアシス
コンテスト
ユーザー torus711
提出日時 2018-06-23 15:09:20
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 19 ms / 5,000 ms
コード長 4,840 bytes
コンパイル時間 1,188 ms
コンパイル使用メモリ 118,500 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-30 18:22:22
合計ジャッジ時間 2,296 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
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 = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T > struct getv_fmt;
template <> struct getv_fmt<       int >{ static constexpr const char *fmt = "%d"; };
template <> struct getv_fmt< long long >{ static constexpr const char *fmt = "%lld"; };
template < typename T > void getv( std::vector< T > &v ){ for_each( begin( v ), end( v ), []( T &a ){ scanf( getv_fmt< T >::fmt, &a ); } ); };

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 NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )
#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

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

constexpr auto INF = LIM<>::max() / 2;

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

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, N, V, ox, oy );
	--ox, --oy;

	VVI board( N, VI( N ) );
	cin >> board;

	using State = tuple< int, int, int, int >;
	// ( HP, Y, X, start pos ( origin or oasis ) );

	static int distances[ 256 ][ 256 ][2];
	fill( AALL( distances ), INF );

	priority_queue< State, VT< State >, greater< State > > que;

	distances[0][0][0] = 0;
	que.EM( 0, 0, 0, 0 );

	if ( ox != -1 )
	{
		distances[ oy ][ ox ][1] = 0;
		que.EM( 0, oy, ox, 1 );
	}

	const auto inside = [&]( const int y, const int x )
	{
		return 0 <= y && y < N && 0 <= x && x < N;
	};

	while ( !que.empty() )
	{
		const int dist = get< 0 >( que.top() );
		const int y = get< 1 >( que.top() );
		const int x = get< 2 >( que.top() );
		const int u = get< 3 >( que.top() );
		que.pop();

		if ( distances[y][x][u] < dist )
		{
			continue;
		}

		REP( d, 4 )
		{
			const int ny = y + dy[d];
			const int nx = x + dx[d];

			if ( !inside( ny, nx ) )
			{
				continue;
			}

			const int nd = dist + board[ ny ][ nx ];

			if ( nd < distances[ ny ][ nx ][u] )
			{
				que.EM( distances[ ny ][ nx ][u] = nd, ny, nx, u );
			}
		}
	}

	bool res = distances[ N - 1 ][ N - 1 ][0] < V;
	if ( ox != -1 )
	{
		int nv = V - distances[ oy ][ ox ][0];

		if ( 0 < nv )
		{
			nv *= 2;
			res |= distances[ N - 1 ][ N - 1 ][1] < nv;
		}
	}

	cout << ( res ? "YES" : "NO" ) << endl;

	return 0;
}
0