結果
問題 | No.1638 Robot Maze |
ユーザー |
![]() |
提出日時 | 2021-08-06 21:34:29 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 5,332 bytes |
コンパイル時間 | 6,114 ms |
コンパイル使用メモリ | 251,896 KB |
最終ジャッジ日時 | 2025-01-23 14:45:01 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/cassert:44, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:33, from main.cpp:1: main.cpp: In function 'auto solve()': main.cpp:130:17: error: call of overloaded 'ssize(__gnu_cxx::__alloc_traits<std::allocator<std::__cxx11::basic_string<char> >, std::__cxx11::basic_string<char> >::value_type&)' is ambiguous 130 | assert(ssize(g[i]) == W); | ~~~~~^~~~~~ main.cpp:17:12: note: candidate: 'int ssize(const T&) [with T = std::__cxx11::basic_string<char>]' 17 | inline int ssize(const T &a) { | ^~~~~ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/string:52, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/bits/locale_classes.h:40, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/bits/ios_base.h:41, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/ios:42, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/istream:38, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/sstream:38, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/complex:45, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/ccomplex:39, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54: /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/bits/range_access.h:351:5: note: candidate: 'constexpr std::common_type_t<long int, typename std::make_signed<decltype (__cont.size())>::type> std::ssize(const _Container&) [with _Container = __cxx11::basic_string<char>; common_type_t<long int, typename make_signed<decltype (__cont.size())>::type> = long
ソースコード
#include <bits/stdc++.h> #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template<typename T, typename U> inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template<typename T, typename U> inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template<typename T> inline int ssize(const T &a) { return (int) std::size(a); } template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &a) { for (auto &x : a) is >> x; return is; } template<typename T, typename U> std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) { return os << "(" << a.first << ", " << a.second << ")"; } template<typename Container> std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template<typename T, typename = void> struct is_iterable : std::false_type {}; template<typename T> struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())), decltype(std::end(std::declval<T>()))>> : std::true_type { }; template<typename T, typename = std::enable_if_t< is_iterable<T>::value && !std::is_same<T, std::string_view>::value && !std::is_same<T, std::string>::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } void print() { std::cout << "\n"; } template<class T> void print(const T &x) { std::cout << x << "\n"; } template<typename Head, typename... Tail> void print(const Head &head, Tail... tail) { std::cout << head << " "; print(tail...); } void read_from_cin() {} template<typename T, typename... Ts> void read_from_cin(T &value, Ts &...args) { std::cin >> value; read_from_cin(args...); } #define INPUT(type, ...) \ type __VA_ARGS__; \ read_from_cin(__VA_ARGS__) #ifdef MY_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #endif using namespace std; template<int sign = 1> struct Infinity { template<typename T> constexpr operator T() const { static_assert(sign == 1 or not std::is_unsigned_v<T>, "must be positive in an unsigned type"); if constexpr (std::numeric_limits<T>::has_infinity) { return T(sign) * std::numeric_limits<T>::infinity(); } else { return T(sign) * (std::numeric_limits<T>::max() / T(2)); } } constexpr Infinity<sign * -1> operator-() const { return {}; } template<typename T> friend constexpr bool operator==(const T &x, const Infinity &y) { return x == T(y); } template<typename T> friend constexpr bool operator!=(const T &x, const Infinity &y) { return x != T(y); } }; constexpr Infinity<> INF; template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>; struct GridState { i64 cost; int r; int c; }; bool operator>(const GridState &x, const GridState &y) { return x.cost > y.cost; } auto solve() { INPUT(int, H, W); INPUT(i64, U, D, R, L, K, P); INPUT(i64, xs, ys, xt, yt); --xs, --ys, --xt, --yt; vector<string> g(H); REP(i, H) { cin >> g[i]; assert(ssize(g[i]) == W); } auto search_shortest_path_on_grid = [&]( const vector<string> &g, const pair<int, int> &start, const pair<int, int> &goal) -> i64 { const array<int, 4> dx = {0, 1, 0, -1}, dy = {1, 0, -1, 0}; auto mincost = vector(H, vector(W, (i64) INF)); MinHeap<GridState> que; auto push = [&](i64 cost, int r, int c) -> bool { if (not chmin(mincost[r][c], cost)) return false; que.push(GridState{cost, r, c}); return true; }; assert(push(0LL, start.first, start.second)); while (not que.empty()) { GridState cur = que.top(); que.pop(); if (cur.cost != mincost[cur.r][cur.c]) continue; if (pair(cur.r, cur.c) == goal) break; assert(g[cur.r][cur.c] != '#'); for (int i = 0; i < 4; ++i) { const int nr = cur.r + dx[i]; const int nc = cur.c + dy[i]; if (nr < 0 or nr >= H or nc < 0 or nc >= W) continue; if (g[nr][nc] == '#') continue; i64 new_cost = cur.cost; if (g[nr][nc] == '@') { new_cost += P; } if (dx[i] == -1 and dy[i] == 0) { new_cost += U; } else if (dx[i] == 1 and dy[i] == 0) { new_cost += D; } else if (dx[i] == 0 and dy[i] == 1) { new_cost += R; } else if (dx[i] == 0 and dy[i] == -1) { new_cost += L; } else { assert(false); } push(new_cost, nr, nc); } } return mincost[goal.first][goal.second]; }; auto mc = search_shortest_path_on_grid(g, {xs, ys}, {xt, yt}); return mc <= K; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << std::fixed << std::setprecision(15); int t = 1; REP(test_case, t) { auto ans = solve(); print(ans ? "Yes" : "No"); } }