結果

問題 No.367 ナイトの転身
ユーザー h_nosonh_noson
提出日時 2016-04-29 23:47:10
言語 C++11
(gcc 13.3.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 1,862 bytes
コンパイル時間 523 ms
コンパイル使用メモリ 59,828 KB
最終ジャッジ日時 2024-11-14 19:42:53
合計ジャッジ時間 919 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:25:16: error: ‘make_tuple’ was not declared in this scope
   25 |         q.push(make_tuple(i,j,true,0));
      |                ^~~~~~~~~~
main.cpp:5:1: note: ‘std::make_tuple’ is defined in header ‘<tuple>’; did you forget to ‘#include <tuple>’?
    4 | #include <queue>
  +++ |+#include <tuple>
    5 | using namespace std;
main.cpp:29:13: error: ‘tie’ was not declared in this scope
   29 |             tie(x,y,knight,cnt) = q.front();
      |             ^~~
main.cpp:29:13: note: ‘std::tie’ is defined in header ‘<tuple>’; did you forget to ‘#include <tuple>’?
In file included from /usr/include/c++/11/deque:67,
                 from /usr/include/c++/11/queue:60,
                 from main.cpp:4:
/usr/include/c++/11/bits/stl_deque.h: In instantiation of ‘void std::deque<_Tp, _Alloc>::_M_destroy_data(std::deque<_Tp, _Alloc>::iterator, std::deque<_Tp, _Alloc>::iterator, const std::allocator<_CharT>&) [with _Tp = std::tuple<int, int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int, int> >; std::deque<_Tp, _Alloc>::iterator = std::_Deque_base<std::tuple<int, int, int, int>, std::allocator<std::tuple<int, int, int, int> > >::iterator]’:
/usr/include/c++/11/bits/stl_deque.h:1007:24:   required from ‘std::deque<_Tp, _Alloc>::~deque() [with _Tp = std::tuple<int, int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int, int> >]’
/usr/include/c++/11/bits/stl_queue.h:96:11:   required from here
/usr/include/c++/11/bits/stl_deque.h:2048:14: error: invalid use of incomplete type ‘std::deque<std::tuple<int, int, int, int>, std::allocator<std::tuple<int, int, int, int> > >::value_type’ {aka ‘class std::tuple<int, int, int, int>’}
 2048 |         if (!__has_trivial_destructor(value_type))
      |              ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/11/bits/move.h:57,
                 from /usr/include/c++/11/bits/exception_ptr.h:43,

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 100000000

typedef long long ll;

int main() {
    int i, j, k, l, h, w;
    bool used[2][500][500] {};
    string s[500];
    cin >> h >> w;
    rep (i,h) cin >> s[i];
    rep (i,h) rep (j,w) if (s[i][j] == 'S') {
        queue<tuple<int,int,int,int>> q;
        int d[8] = {2,1,2,-1,-2,1,-2,-1};
        used[1][i][j] = true;
        q.push(make_tuple(i,j,true,0));
        while (!q.empty()) {
            int x, y, cnt;
            bool knight;
            tie(x,y,knight,cnt) = q.front();
            q.pop();
            if (s[x][y] == 'G') {
                cout << cnt << endl;
                return 0;
            }
            knight ^= s[x][y] == 'R';
            if (knight) {
                rep (k,8) {
                    int nx = x+d[k];
                    int ny = y+d[(k+1)%8];
                    if (nx >= 0 && nx < h && ny >= 0 && ny < w && !used[knight][nx][ny]) {
                        used[knight][nx][ny] = true;
                        q.push(make_tuple(nx,ny,knight,cnt+1));
                    }
                }
            }
            else {
                for (k = -1; k <= 1; k+=2) {
                    for (l = -1; l <= 1; l+=2) {
                        int nx = x+k;
                        int ny = y+l;
                        if (nx >= 0 && nx < h && ny >= 0 && ny < w && !used[knight][nx][ny]) {
                            used[knight][nx][ny] = true;
                            q.push(make_tuple(nx,ny,knight,cnt+1));
                        }
                    }
                }
            }
        }
    }
    cout << -1 << endl;
    return 0;
}
0