結果
| 問題 | No.124 門松列(3) |
| ユーザー |
 firiexp
|
| 提出日時 | 2019-10-30 10:50:26 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 2,052 bytes |
| コンパイル時間 | 765 ms |
| コンパイル使用メモリ | 97,036 KB |
| 最終ジャッジ日時 | 2024-11-14 21:48:41 |
| 合計ジャッジ時間 | 1,375 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:17:39: error: '::numeric_limits' has not been declared
17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
| ^~~~~~~~~~~~~~
main.cpp:17:55: error: expected primary-expression before '>' token
17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
| ^
main.cpp:17:61: error: no matching function for call to 'max()'
17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
| ~~~~~^~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:50,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:38,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39,
from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
254 | max(const _Tp& __a, const _Tp& __b)
| ^~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: template argument deduction/substitution failed:
main.cpp:17:61: note: candidate expects 2 arguments, 0 provided
17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
| ~~~~~^~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:300:5: note: candidate: 'templat
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <map>#include <set>#include <queue>#include <stack>#include <numeric>#include <bitset>#include <cmath>static const int MOD = 1000000007;using ll = long long;using u32 = uint32_t;using namespace std;template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;template <class T, class U>vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }template<class... Ts, class U>auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }bool IsKadomatsu(int a, int b, int c){if(!min({a, b, c})) return true;if(a == b || b == c || c == a) return false;return max({a, b, c}) == b || min({a, b, c}) == b;}int main() {int w, h;cin >> w >> h;auto grid = make_v(h+2, w+2, 0);for (int i = 0; i < h; ++i) {for (int j = 0; j < w; ++j) {cin >> grid[i+1][j+1];}}auto dp = make_v(h, w, 10, 10, INF<int>);queue<tuple<int, int, int, int>> Q;dp[0][0][0][grid[1][1]] = 0;Q.emplace(0, 0, 0, grid[1][1]);array<int, 4> dy{-1, 1, 0, 0}, dx{0, 0, -1, 1};while(!Q.empty()){int s, t, a, b; tie(s, t, a, b) = Q.front(); Q.pop();for (int i = 0; i < 4; ++i) {int c = grid[s+1+dy[i]][t+1+dx[i]];if(!c) continue;if(dp[s][t][a][b]+1 >= dp[s+dy[i]][t+dx[i]][b][c]) continue;if(IsKadomatsu(a, b, c)){dp[s+dy[i]][t+dx[i]][b][c] = dp[s][t][a][b]+1;Q.emplace(s+dy[i], t+dx[i], b, c);}}}int ans = INF<int>;for (int i = 0; i < 10; ++i) {for (int j = 0; j < 10; ++j) {ans = min(ans, dp[h-1][w-1][i][j]);}}cout << (ans < INF<int> ? ans : -1) << "\n";return 0;}