結果
| 問題 | No.367 ナイトの転身 |
| コンテスト | |
| ユーザー |
 torus711
|
| 提出日時 | 2016-04-29 22:48:38 |
| 言語 | C++14 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 13 ms / 2,000 ms |
| コード長 | 3,843 bytes |
| 記録 | |
| コンパイル時間 | 825 ms |
| コンパイル使用メモリ | 125,220 KB |
| 実行使用メモリ | 6,400 KB |
| 最終ジャッジ日時 | 2026-04-27 05:32:21 |
| 合計ジャッジ時間 | 2,068 ms |
|
ジャッジサーバーID （参考情報） |
judge3_1 / judge2_1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 27 |
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/string:53,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/locale_classes.h:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/ios_base.h:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ios:46,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/ostream.h:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ostream:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/iostream:43,
from main.cpp:1:
In function 'constexpr const _Tp& std::min(const _Tp&, const _Tp&) [with _Tp = int]',
inlined from 'int main()' at main.cpp:148:21:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_algobase.h:239:15: warning: 'gy' may be used uninitialized [-Wmaybe-uninitialized]
239 | if (__b < __a)
| ~~~~^~~~~
main.cpp: In function 'int main()':
main.cpp:95:21: note: 'gy' was declared here
95 | int sy, sx, gy, gx;
| ^~
In function 'constexpr const _Tp& std::min(const _Tp&, const _Tp&) [with _Tp = int]',
inlined from 'int main()' at main.cpp:148:21:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_algobase.h:239:15: warning: 'gx' may be used uninitialized [-Wmaybe-uninitialized]
239 | if (__b < __a)
| ~~~~^~~~~
main.cpp: In function 'int main()':
main.cpp:95:25: note: 'gx' was declared here
95 | int sy, sx, gy, gx;
| ^~
main.cpp:116:34: warning: 'sy' may be used uninitialized [-Wmaybe-uninitialized]
116 | distances[ sy ][ sx ][0] = 0;
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
main.cpp:95:13: note: 'sy' was declared here
95 | int sy, sx, gy, gx;
| ^~
ソースコード
#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 INF = LIM<>::max() / 2;
constexpr int dy[][8] = {
{ -2, -2, -1, -1, 1, 1, 2, 2 },
{ -1, -1, 1, 1 }
};
constexpr int dx[][8] = {
{ -1, 1, -2, 2, -2, 2, -1, 1 },
{ -1, 1, -1, 1 }
};
int distances[ 512 ][ 512 ][2];
int main()
{
cin.tie( 0 );
ios::sync_with_stdio( false );
int H, W;
cin >> H >> W;
VS board( H );
cin >> board;
const auto inside = [&]( const int y, const int x ){ return 0 <= y && y < H && 0 <= x && x < W; };
int sy, sx, gy, gx;
REP( i, H )
{
REP( j, W )
{
if ( board[i][j] == 'S' )
{
sy = i;
sx = j;
}
if ( board[i][j] == 'G' )
{
gy = i;
gx = j;
}
}
}
using State = tuple< int , int, int >;
fill( AALL( distances, int ), INF );
distances[ sy ][ sx ][0] = 0;
queue< State > que;
que.EM( sy, sx, 0 );
while ( !que.empty() )
{
const int y = get< 0 >( que.front() );
const int x = get< 1 >( que.front() );
const int p = get< 2 >( que.front() );
que.pop();
REP( d, p ? 4 : 8 )
{
const int ny = y + dy[p][d];
const int nx = x + dx[p][d];
if ( !inside( ny, nx ) )
{
continue;
}
const int np = board[ ny ][ nx ] == 'R' ? 1 - p : p;
if ( distances[y][x][p] + 1 < distances[ ny ][ nx ][ np ] )
{
distances[ ny ][ nx ][ np ] = distances[y][x][p] + 1;
que.EM( ny, nx, np );
}
}
}
const int res = min( distances[ gy ][ gx ][0], distances[ gy ][ gx ][1] );
cout << ( res == INF ? -1 : res ) << endl;
return 0;
}