結果

問題 No.3199 Key-Door Grid
ユーザー hirakuuuu
提出日時 2025-07-11 22:20:29
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 125 ms / 3,000 ms
コード長 1,739 bytes
コンパイル時間 3,977 ms
コンパイル使用メモリ 288,724 KB
実行使用メモリ 21,632 KB
最終ジャッジ日時 2025-07-11 22:20:36
合計ジャッジ時間 6,453 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:53:19: warning: ‘gx’ may be used uninitialized [-Wmaybe-uninitialized]
   53 |         if(dist[gx][gy][i] == -1) continue;
      |                   ^
main.cpp:23:17: note: ‘gx’ was declared here
   23 |     int sx, sy, gx, gy;
      |                 ^~
main.cpp:53:23: warning: ‘gy’ may be used uninitialized [-Wmaybe-uninitialized]
   53 |         if(dist[gx][gy][i] == -1) continue;
      |                       ^
main.cpp:23:21: note: ‘gy’ was declared here
   23 |     int sx, sy, gx, gy;
      |                     ^~
In file included from /usr/include/c++/13/bits/uses_allocator_args.h:38,
                 from /usr/include/c++/13/bits/memory_resource.h:41,
                 from /usr/include/c++/13/string:58,
                 from /usr/include/c++/13/bitset:52,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52,
                 from main.cpp:1:
In constructor ‘constexpr std::_Head_base<_Idx, _Head, false>::_Head_base(_UHead&&) [with _UHead = int&; long unsigned int _Idx = 0; _Head = int]’,
    inlined from ‘constexpr std::_Tuple_impl<_Idx, _Head, _Tail ...>::_Tuple_impl(_UHead&&, _UTail&& ...) [with _UHead = int&; _UTail = {int&, int&}; <template-parameter-2-3> = void; long unsigned int _Idx = 0; _Head = int; _Tail = {int, int}]’ at /usr/include/c++/13/tuple:293:38,
    inlined from ‘constexpr std::tuple< <template-parameter-1-1> >::tuple(_UElements&& ...) [with _UElements = {int&, int&, int&}; bool _Valid = true; typename std::enable_if<_TCC<_Valid>::__is_implicitly_constructible<_UElements ...>(), bool>::type <anonymous> = true; _Elements = {int, int, int}]’ at /usr/include/c++/13/tuple:891:54,
    inlined from ‘int main()’ at main.cpp:35:13:
/usr/include/c++/13/tuple:201:11: warning: ‘sx’ may be used uninitialized [-Wmaybe-uninitialized]
  201 |         : _M_head_impl(std::forward<_UHead>(__h)) { }
      |           ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

ソースコード

diff # 

#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, a, n) for(int i = a; i < n; i++)
#define rrep(i, a, n) for(int i = a; i >= n; i--)
#define inr(l, x, r) (l <= x && x < r)
#define ll long long
#define ld long double

// using mint = modint1000000007;
// using mint = modint998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1e18;

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}


int main(){
    int h, w, m; cin >> h >> w >> m;
    vector<string> s(h);
    int sx, sy, gx, gy;
    rep(i, 0, h){
        cin >> s[i];
        rep(j, 0, w){
            if(s[i][j] == 'S') sx = i, sy = j;
            if(s[i][j] == 'G') gx = i, gy = j;
        }
    }

    vector<vector<vector<int>>> dist(h, vector<vector<int>>(w, vector<int>(m+1, -1)));
    queue<tuple<int, int, int>> que;
    dist[sx][sy][m] = 0;
    que.push({sx, sy, m});
    while(!que.empty()){
        auto [px, py, k] = que.front(); que.pop();
        rep(i, 0, 4){
            int nx = px+(i-1)%2, ny = py+(i-2)%2;
            int nk = k;
            if(!inr(0, nx, h) || !inr(0, ny, w)) continue;
            if(s[nx][ny] == '#') continue;
            if(inr(0, s[nx][ny]-'a', m) && (s[nx][ny]-'a') != k) continue;
            if(inr(0, s[nx][ny]-'1', m)) nk = s[nx][ny]-'1';
            if(dist[nx][ny][nk] != -1) continue;
            dist[nx][ny][nk] = dist[px][py][k]+1;
            que.push({nx, ny, nk});
        }
    }

    int ans = IINF;
    rep(i, 0, m+1){
        if(dist[gx][gy][i] == -1) continue;
        chmin(ans, dist[gx][gy][i]);
    }
    if(ans == IINF) ans = -1;
    cout << ans << endl;

    
    return 0;
}
0