結果

問題 No.3199 Key-Door Grid
ユーザー coindarw
提出日時 2025-07-11 21:55:56
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 113 ms / 3,000 ms
コード長 7,382 bytes
コンパイル時間 5,733 ms
コンパイル使用メモリ 334,412 KB
実行使用メモリ 14,592 KB
最終ジャッジ日時 2025-07-11 21:56:07
合計ジャッジ時間 8,356 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます
コンパイルメッセージ
In lambda function,
    inlined from ‘int main()’ at main.cpp:122:36:
main.cpp:93:16: warning: ‘sy’ may be used uninitialized [-Wmaybe-uninitialized]
   93 |         dist[0][sy][sx] = 0;
      |         ~~~~~~~^
main.cpp: In function ‘int main()’:
main.cpp:117:9: note: ‘sy’ was declared here
  117 |     int sy, sx, gy, gx;
      |         ^~
In lambda function,
    inlined from ‘int main()’ at main.cpp:122:36:
main.cpp:93:20: warning: ‘sx’ may be used uninitialized [-Wmaybe-uninitialized]
   93 |         dist[0][sy][sx] = 0;
      |         ~~~~~~~~~~~^
main.cpp: In function ‘int main()’:
main.cpp:117:13: note: ‘sx’ was declared here
  117 |     int sy, sx, gy, gx;
      |             ^~
main.cpp:124:43: warning: ‘gy’ may be used uninitialized [-Wmaybe-uninitialized]
  124 |     rep(i, 10) { ans = min(ans, dist[i][gy][gx]); }
      |                                           ^
main.cpp:117:17: note: ‘gy’ was declared here
  117 |     int sy, sx, gy, gx;
      |                 ^~
main.cpp:124:47: warning: ‘gx’ may be used uninitialized [-Wmaybe-uninitialized]
  124 |     rep(i, 10) { ans = min(ans, dist[i][gy][gx]); }
      |                                               ^
main.cpp:117:21: note: ‘gx’ was declared here
  117 |     int sy, sx, gy, gx;
      |                     ^~

ソースコード

diff # 

#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>

#include <atcoder/all>
#else
#include <mylibs/all.h>
#endif

using ll = long long;
using lll = __int128_t;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define length(v) ((int)(v).size())
constexpr int inf = 2'000'000'000;
constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;

// clang-format off
using vint = vector<int>;using vvint = vector<vector<int>>;using vvvint = vector<vector<vector<int>>>;
using vll = vector<ll>;using vvll = vector<vector<ll>>;using vvvll = vector<vector<vector<ll>>>;
using vlll = vector<lll>;using vvlll = vector<vector<lll>>;using vvvlll = vector<vector<vector<lll>>>;
using vchar = vector<char>;using vvchar = vector<vector<char>>;using vvvchar = vector<vector<vector<char>>>;
using vstr = vector<string>;using vvstr = vector<vector<string>>;using vvvstr = vector<vector<vector<string>>>;
using vpi = vector<pair<int, int>>;using vvpi = vector<vector<pair<int, int>>>;using vvpint = vector<vector<pair<int, int>>>;
using vpl = vector<pair<ll, ll>>;using vvpl = vector<vector<pair<ll, ll>>>;using vvplint = vector<vector<pair<ll, int>>>;
using vbool = vector<bool>;using vvbool = vector<vector<bool>>;using vvvbool = vector<vector<vector<bool>>>;

#define Vec(type, ...) __make_vec<type>(__VA_ARGS__)
template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>
auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));}
#define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__)
template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);}
template <class T, T init, class... Ts>
auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));}

template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;}
inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); }
template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); }

template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {};
template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>;
template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value;
template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>;
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>;
template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;}
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;}
template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;}
template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;}
void inp() {}
template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);}
template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];}
template <typename T>void oup(const T& a) {cout << a << "\n";}
template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);}

inline string YesNo(bool cond) { return cond ? "Yes" : "No"; }
inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;}
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)
template <typename T>void debug_out(T t) {cerr << t << "\n";}
template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);}
#endif

#ifdef ONLINE_JUDGE
#define todo(...) static_assert(false)
#else
#define todo(...)
#endif
// clang-format on

#pragma GCC diagnostic push
#pragma GCC diagnostic error "-Wshadow"
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int h, w, m;
    inp(h, w, m);
    vector<string> vs(h);
    rep(i, h) inp(vs[i]);
    auto grid_bfs = [&](const auto& v, int sy, int sx) {
        const int dd[] = {0, 1, 0, -1, 0};
        using T = tuple<int, int, int>;
        queue<T> que;
        vector dist = vector(10, vector(h, vector<int>(w, inf)));
        dist[0][sy][sx] = 0;
        que.emplace(0, sy, sx);
        while (!que.empty()) {
            auto [key, y, x] = que.front();
            que.pop();
            rep(i, 4) {
                int ny = y + dd[i], nx = x + dd[i + 1];
                if (ny < 0 || ny >= h || nx < 0 || nx >= w) continue;
                if (v[ny][nx] == '#') continue;
                int nkey = key;
                if ('a' <= v[ny][nx] && v[ny][nx] <= 'i') {
                    int sk = v[ny][nx] - 'a' + 1;
                    if (key != sk) continue;
                } else if ('1' <= v[ny][nx] && v[ny][nx] <= '9') {
                    nkey = v[ny][nx] - '0';
                }
                if (dist[nkey][ny][nx] > dist[key][y][x] + 1) {
                    dist[nkey][ny][nx] = dist[key][y][x] + 1;
                    que.emplace(nkey, ny, nx);
                }
            }
        }
        return dist;
    };
    int sy, sx, gy, gx;
    rep(y, h) rep(x, w) {
        if (vs[y][x] == 'S') sy = y, sx = x;
        if (vs[y][x] == 'G') gy = y, gx = x;
    }
    auto dist = grid_bfs(vs, sy, sx);
    int ans = inf;
    rep(i, 10) { ans = min(ans, dist[i][gy][gx]); }
    if (ans == inf) ans = -1;

    oup(ans);
}
#pragma GCC diagnostic pop
0