結果

問題 No.323 yuki国
ユーザー torus711
提出日時 2016-06-11 15:41:03
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 226 ms / 5,000 ms
コード長 3,518 bytes
コンパイル時間 1,045 ms
コンパイル使用メモリ 110,072 KB
実行使用メモリ 23,680 KB
最終ジャッジ日時 2024-06-28 12:34:54
合計ジャッジ時間 5,338 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 6
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

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 <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 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 = 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; }
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 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 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end()
#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 int dy[] = { 0, 1, 0, -1 };
constexpr int dx[] = { 1, 0, -1, 0 };
int reachable[ 64 ][ 64 ][ 2048 ];
int main()
{
    cin.tie( 0 );
    ios::sync_with_stdio( false );
    int H, W;
    cin >> H >> W;
    int A, SY, SX;
    cin >> A >> SY >> SX;
    int B, GY, GX;
    cin >> B >> GY >> GX;
    VS board( H );
    cin >> board;
    using State = tuple< int, int, int >;
    
    queue< State > que;
    que.EM( SY, SX, A );
    reachable[ SY ][ SX ][A] = 1;
    const auto inside = [=]( const int y, const int x ){ return 0 <= y && y < H && 0 <= x && x < W; };
    while ( !que.empty() )
    {
        const int y = get< 0 >( que.front() );
        const int x = get< 1 >( que.front() );
        const int s = get< 2 >( que.front() );
        que.pop();
        REP( d, 4 )
        {
            const int ny = y + dy[d];
            const int nx = x + dx[d];
            if ( !inside( ny, nx ) )
            {
                continue;
            }
            const int ns = s + ( board[ ny ][ nx ] == '*' ? 1 : -1 );
            if ( ns < 1 || 2048 <= ns )
            {
                continue;
            }
            if ( !reachable[ ny ][ nx ][ ns ] )
            {
                reachable[ ny ][ nx ][ ns ] = 1;
                que.EM( ny, nx, ns );
            }
        }
    }
    cout << ( reachable[ GY ][ GX ][B] ? "Yes" : "No" ) << endl;
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0