結果
問題 | No.1283 Extra Fee |
ユーザー | KoD |
提出日時 | 2020-11-06 22:01:14 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,492 bytes |
コンパイル時間 | 661 ms |
コンパイル使用メモリ | 68,348 KB |
最終ジャッジ日時 | 2025-01-15 20:41:12 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:18:18: error: ‘int32_t’ in namespace ‘std’ does not name a type 18 | template <class T, class U> | ^~~~~~~ main.cpp:19:18: error: ‘int64_t’ in namespace ‘std’ does not name a type 19 | constexpr bool chmin(T &lhs, const U &rhs) { | ^~~~~~~ main.cpp:20:18: error: ‘uint32_t’ in namespace ‘std’ does not name a type; did you mean ‘wint_t’? 20 | if (lhs > rhs) { lhs = rhs; return true; } | ^~~~~~~~ | wint_t main.cpp:21:18: error: ‘uint64_t’ in namespace ‘std’ does not name a type; did you mean ‘wint_t’? 21 | return false; | ^ | wint_t main.cpp:25:11: error: ‘i32’ does not name a type 25 | constexpr bool chmax(T &lhs, const U &rhs) { | ^~~ main.cpp:26:11: error: ‘i64’ does not name a type 26 | if (lhs < rhs) { lhs = rhs; return true; } | ^~~ main.cpp:28:22: error: ‘i32’ was not declared in this scope 28 | } | ^ main.cpp:28:28: error: template argument 1 is invalid 28 | } | ^ main.cpp:28:30: error: scalar object ‘dx’ requires one element in initializer 28 | } | ^ main.cpp:29:22: error: ‘i32’ was not declared in this scope 29 | | ^ main.cpp:29:28: error: template argument 1 is invalid 29 | | ^ main.cpp:29:30: error: scalar object ‘dy’ requires one element in initializer 29 | | ^ main.cpp: In function ‘int main()’: main.cpp:34:27: error: ‘u32’ was not declared in this scope 34 | | ^ main.cpp:34:27: error: template argument 1 is invalid main.cpp:34:27: error: template argument 2 is invalid main.cpp:34:30: error: template argument 1 is invalid 34
ソースコード
#line 1 "main.cpp" /** * @title Template */ #include <iostream> #include <algorithm> #include <utility> #include <numeric> #include <vector> #include <array> #include <cassert> #include <queue> #line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp" template <class T, class U> constexpr bool chmin(T &lhs, const U &rhs) { if (lhs > rhs) { lhs = rhs; return true; } return false; } template <class T, class U> constexpr bool chmax(T &lhs, const U &rhs) { if (lhs < rhs) { lhs = rhs; return true; } return false; } /** * @title Chmin/Chmax */ #line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp" #line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp" class range { struct iter { std::size_t itr; constexpr iter(std::size_t pos) noexcept: itr(pos) { } constexpr void operator ++ () noexcept { ++itr; } constexpr bool operator != (iter other) const noexcept { return itr != other.itr; } constexpr std::size_t operator * () const noexcept { return itr; } }; struct reviter { std::size_t itr; constexpr reviter(std::size_t pos) noexcept: itr(pos) { } constexpr void operator ++ () noexcept { --itr; } constexpr bool operator != (reviter other) const noexcept { return itr != other.itr; } constexpr std::size_t operator * () const noexcept { return itr; } }; const iter first, last; public: constexpr range(std::size_t first, std::size_t last) noexcept: first(first), last(std::max(first, last)) { } constexpr iter begin() const noexcept { return first; } constexpr iter end() const noexcept { return last; } constexpr reviter rbegin() const noexcept { return reviter(*last - 1); } constexpr reviter rend() const noexcept { return reviter(*first - 1); } }; /** * @title Range */ #line 17 "main.cpp" using i32 = std::int32_t; using i64 = std::int64_t; using u32 = std::uint32_t; using u64 = std::uint64_t; using isize = std::ptrdiff_t; using usize = std::size_t; constexpr i32 inf32 = (i32(1) << 30) - 1; constexpr i64 inf64 = (i64(1) << 62) - 1; constexpr std::array<i32, 8> dx = { 0, 0, -1, 1, -1, -1, 1, 1 }; constexpr std::array<i32, 8> dy = { -1, 1, 0, 0, -1, 1, -1, 1 }; int main() { usize N, M; std::cin >> N >> M; std::vector<std::vector<u32>> cost(N, std::vector<u32>(N)); while (M--) { usize x, y; u32 c; std::cin >> x >> y >> c; --x; --y; cost[x][y] = c; } std::vector<std::vector<std::array<u64, 2>>> dist(N, std::vector<std::array<u64, 2>>(N)); for (auto &a: dist) { for (auto &b: a) { b.fill(inf64); } } using State = std::tuple<u64, usize, usize, usize>; std::priority_queue<State, std::vector<State>, std::greater<State>> que; const auto try_push = [&](const usize x, const usize y, const usize k, const u64 d) { if (chmin(dist[x][y][k], d)) { que.emplace(dist[x][y][k], x, y, k); } }; try_push(0, 0, 0, 0); while (!que.empty()) { const auto [d, x, y, k] = que.top(); que.pop(); if (d > dist[x][y][k]) { continue; } for (auto l: range(0, 4)) { const isize ni = (isize) x + dx[l]; const isize nj = (isize) y + dy[l]; if (ni >= 0 && ni < (isize) N && nj >= 0 && nj < (isize) N) { if (k == 0) { try_push(ni, nj, 1, dist[x][y][k] + 1); } try_push(ni, nj, k, dist[x][y][k] + cost[ni][nj] + 1); } } } std::cout << dist[N - 1][N - 1][1] << '\n'; return 0; }