結果
問題 | No.34 砂漠の行商人 |
ユーザー | h_noson |
提出日時 | 2016-03-26 14:25:50 |
言語 | C++11 (gcc 11.4.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,193 bytes |
コンパイル時間 | 365 ms |
コンパイル使用メモリ | 58,012 KB |
最終ジャッジ日時 | 2023-09-10 19:23:22 |
合計ジャッジ時間 | 771 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:21:12: error: ‘make_tuple’ was not declared in this scope q.push(make_tuple(sx,sy,0,0)); ^~~~~~~~~~ main.cpp:21:12: note: ‘std::make_tuple’ is defined in header ‘<tuple>’; did you forget to ‘#include <tuple>’? main.cpp:5:1: +#include <tuple> using namespace std; main.cpp:21:12: q.push(make_tuple(sx,sy,0,0)); ^~~~~~~~~~ main.cpp:27:9: error: ‘tie’ was not declared in this scope tie(x,y,d,c) = q.front(); q.pop(); ^~~ main.cpp:27:9: note: suggested alternative: ‘time’ tie(x,y,d,c) = q.front(); q.pop(); ^~~ time In file included from /usr/include/c++/8/deque:64, from /usr/include/c++/8/queue:60, from main.cpp:4: /usr/include/c++/8/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_iterator<std::tuple<int, int, int, int>, std::tuple<int, int, int, int>&, std::tuple<int, int, int, int>*>]’: /usr/include/c++/8/bits/stl_deque.h:1055:9: 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++/8/bits/stl_queue.h:96:11: required from here /usr/include/c++/8/bits/stl_deque.h:2081:6: 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>’} if (!__has_trivial_destructor(value_type)) ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/8/bits/move.h:55, from /usr/include/c++/8/bits/nested_exception.h:40,
ソースコード
#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,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, n, v, sx, sy, gx, gy; int l[101][101], cost[101][101]; queue<tuple<int,int,int,int>> q; cin >> n >> v >> sx >> sy >> gx >> gy; REP (i,1,n+1) REP (j,1,n+1) cin >> l[j][i]; q.push(make_tuple(sx,sy,0,0)); REP (i,1,n+1) fill(cost[i]+1,cost[i]+n+1,INF); cost[sx][sy] = 0; while (!q.empty()) { int x, y, d, c; int dx[4] {-1,0,1,0}; tie(x,y,d,c) = q.front(); q.pop(); if (x == gx && y == gy) { cout << d << endl; return 0; } rep (i,4) { int nx = x+dx[i]; int ny = y+dx[(i+1)%4]; if (min(nx,ny) >= 1 && max(nx,ny) <= n && c+l[nx][ny] < v && c+l[nx][ny] < cost[nx][ny]) { cost[nx][ny] = c+l[nx][ny]; q.push(make_tuple(nx,ny,d+1,cost[nx][ny])); } } } cout << -1 << endl; return 0; }