結果

問題 No.367 ナイトの転身
コンテスト
ユーザー sntea
提出日時 2016-05-03 02:28:59
言語 C++11
(gcc 15.2.0 + boost 1.89.0)
コンパイル:
g++-15 -O2 -lm -std=gnu++11 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
MLE  
実行時間 -
コード長 2,428 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 1,370 ms
コンパイル使用メモリ 186,796 KB
実行使用メモリ 1,305,136 KB
最終ジャッジ日時 2026-04-20 18:23:50
合計ジャッジ時間 4,964 ms
ジャッジサーバーID
（参考情報） 		judge1_0 / judge3_0
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 10 MLE * 2 -- * 15
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:71:22: warning: 'gx' may be used uninitialized [-Wmaybe-uninitialized]
   71 |                 if(b == gx and c == gy){
      |                    ~~^~~~~
main.cpp:49:21: note: 'gx' was declared here
   49 |         int sx, sy, gx, gy;
      |                     ^~
main.cpp:71:34: warning: 'gy' may be used uninitialized [-Wmaybe-uninitialized]
   71 |                 if(b == gx and c == gy){
      |                                ~~^~~~~
main.cpp:49:25: note: 'gy' was declared here
   49 |         int sx, sy, gx, gy;
      |                         ^~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/functional:55,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/x86_64-pc-linux-gnu/bits/stdc++.h:55,
                 from main.cpp:1:
In constructor 'constexpr std::_Tuple_impl<_Idx, _Head, _Tail ...>::_Tuple_impl(std::_Tuple_impl<_Idx, _Head, _Tail ...>&&) [with long unsigned int _Idx = 1; _Head = int; _Tail = {int, int}]',
    inlined from 'constexpr std::_Tuple_impl<_Idx, _Head, _Tail ...>::_Tuple_impl(std::_Tuple_impl<_Idx, _UHead, _UTails ...>&&) [with _UHead = int; _UTails = {int, int, int}; long unsigned int _Idx = 0; _Head = bool; _Tail = {int, int, int}]' at /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/tuple:339:57,
    inlined from 'constexpr std::tuple< <template-parameter-1-1> >::tuple(std::tuple<_Args1 ...>&&) [with _UElements = {int, int, int, int}; bool _Valid = true; typename std::enable_if<_TCC<_Valid>::__is_implicitly_constructible<_UElements ...>(), bool>::type <anonymous> = true; _Elements = {bool, int, int, int}]' at /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/tuple:1533:65,
    inlined from 'int main()' at main.cpp:64:20:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/tuple:324:7: warning: 'sx' may be used uninitialized [-Wmaybe-uninitialized]
  324 |       _Tuple_impl(_Tuple_impl&&)

ソースコード

diff #
raw source code 

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define PB push_back
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
#else
	#define DEBUG(x)
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define INF 1e8

typedef pair<int,int> P;
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<LL,LL> LP;

void ios_init(){ ios::sync_with_stdio(false); cin.tie(0);	
	//cout.setf(ios::fixed);
	//cout.precision(12);
}

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

int main()
{
	ios_init();
	int h,w;
	cin >> h >> w;
	vector<string> s(h);
	REP(i,h){
		cin >> s[i];
	}
	int sx, sy, gx, gy;
	REP(i,h){
		REP(j,w){
			if(s[i][j] == 'S'){
				sx = i;
				sy = j;
			}else if(s[i][j] == 'G'){
				gx = i;
				gy = j;
			}
		}
	}
	bool gf[2][h][w];
	fill(gf[0][0],gf[2][0],false);
	queue<tuple<bool,int,int,int>> qu;
	qu.push(make_tuple(0,sx,sy,0));
	while(!qu.empty()){
		auto t = qu.front();
		qu.pop();
		int a = get<0>(t);
		int b = get<1>(t);
		int c = get<2>(t);
		if(b == gx and c == gy){
			cout << get<3>(t) << endl;
			return 0;
		}
		gf[a][b][c] = true;
		if(a){
			REP(k,4){
				int ni = b+dx[k], nj = c+dy[k];
				if(0 <= ni and ni < h and 0 <= nj and nj < w){
					if(s[ni][nj] != 'R'){
						if(!gf[1][ni][nj]) qu.push(make_tuple(1,ni,nj,get<3>(t)+1));
					}else{
						if(!gf[0][ni][nj]) qu.push(make_tuple(0,ni,nj,get<3>(t)+1));
					}
				}
			}	
		}else{
			REP(k,4){
				int dx = ddx[k], dy = ddy[k];
				int ni = b+dx, nj = c+dy*2;
				if(0 <= ni and ni < h and 0 <= nj and nj < w){
					if(s[ni][nj] != 'R'){
						if(!gf[0][ni][nj]) qu.push(make_tuple(0,ni,nj,get<3>(t)+1));
					}else{
						if(!gf[1][ni][nj]) qu.push(make_tuple(1,ni,nj,get<3>(t)+1));
					}
				}
				ni = b+2*dx;
				nj = c+dy;
				if(0 <= ni and ni < h and 0 <= nj and nj < w){
					if(s[ni][nj] != 'R'){
						if(!gf[0][ni][nj]) qu.push(make_tuple(0,ni,nj,get<3>(t)+1));
					}else{
						if(!gf[1][ni][nj]) qu.push(make_tuple(1,ni,nj,get<3>(t)+1));
					}
				}
			}
		}
	}
	cout << -1 << endl;
	return 0;
}
0