結果

問題 No.3199 Key-Door Grid
コンテスト
ユーザー deuteridayo
提出日時 2025-07-11 21:44:42
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 311 ms / 3,000 ms
コード長 4,248 bytes
コンパイル時間 6,073 ms
コンパイル使用メモリ 335,104 KB
実行使用メモリ 33,408 KB
最終ジャッジ日時 2025-07-11 21:45:09
合計ジャッジ時間 10,956 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:78:10: warning: ‘sx’ may be used uninitialized [-Wmaybe-uninitialized]
   78 |     dp[sx][sy][0] = 0;
      |          ^
main.cpp:59:9: note: ‘sx’ was declared here
   59 |     int sx,sy,gx,gy;
      |         ^~
main.cpp:78:14: warning: ‘sy’ may be used uninitialized [-Wmaybe-uninitialized]
   78 |     dp[sx][sy][0] = 0;
      |              ^
main.cpp:59:12: note: ‘sy’ was declared here
   59 |     int sx,sy,gx,gy;
      |            ^~
main.cpp:119:37: warning: ‘gx’ may be used uninitialized [-Wmaybe-uninitialized]
  119 |     rep(i, M+1) ans = min(ans, dp[gx][gy][i]);
      |                                     ^
main.cpp:59:15: note: ‘gx’ was declared here
   59 |     int sx,sy,gx,gy;
      |               ^~
main.cpp:119:41: warning: ‘gy’ may be used uninitialized [-Wmaybe-uninitialized]
  119 |     rep(i, M+1) ans = min(ans, dp[gx][gy][i]);
      |                                         ^
main.cpp:59:18: note: ‘gy’ was declared here
   59 |     int sx,sy,gx,gy;
      |                  ^~

ソースコード

diff # 

#ifndef MY_HEADER
#define MY_HEADER



#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
using llint = __int128_t;
struct edge;
using graph = vector<vector<edge>>;
#define endl '\n'
constexpr int INF = 1<<30;
constexpr lint INF64 = 1LL<<61;
constexpr lint mod107 = 1e9+7;
using mint107 = modint1000000007;
constexpr long mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x) {assert(x >= 0); lint ans = sqrt(x); while(ans*ans > x)ans--; while((ans+1)*(ans+1)<=x)ans++; return ans;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
double Dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
lint DistSqr(lint x1, lint y1, lint x2, lint y2){return (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2); }
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= p;} firstCallnCr = false;} if(n<0)return 0; if(r<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define rrep(i, x) for(int i = x-1; i >= 0; i--)
#define vec vector
#define pb push_back
#define eb emplace_back
#define se second
#define fi first
#define al(x) x.begin(),x.end()
#define ral(x) x.rbegin(),x.rend()

struct edge{
    edge(lint v, lint c = 1) {to = v, cost = c;}
    lint to;
    lint cost;
};

#endif


int main(){
    lint H, W, M;
    cin >> H >> W >> M;
    vec<vec<char>>S(H+2, vec<char>(W+2, '#'));
    int sx,sy,gx,gy;

    rep(i, H) {
        rep(j, W) {
            char c;cin >> c;
            S[i+1][j+1] = c;
            if(c == 'S'){
                sx = i+1;
                sy = j+1;
            }
            if(c == 'G') {
                gx = i+1;
                gy = j+1;
            }
        }
    }
    vec<int>dx = {0,0,1,-1};
    vec<int>dy = {1,-1,0,0};
    vec dp(H+1, vec(W+1, vec<lint>(M+1, INF64)));
    dp[sx][sy][0] = 0;
    queue<vec<int>> que;
    que.push({sx,sy,0});


    while(!que.empty()) {
        auto v = que.front();
        que.pop();
        int x = v[0];
        int y = v[1];
        int k = v[2];

        rep(d, 4) {
            int nx = x + dx[d];
            int ny = y + dy[d];
            if(S[nx][ny] == '#') continue;
            else if(S[nx][ny] >= 'a' && S[nx][ny ] <= 'z') {
                if(k != S[nx][ny]-'a'+1) continue;
                if(dp[nx][ny][k] > dp[x][y][k] + 1) {
                    dp[nx][ny][k] = dp[x][y][k] + 1;
                    que.push({nx,ny,k});
                }
            }
            else if(S[nx][ny] >= '0' && S[nx][ny ] <= '9') {
                int nk = S[nx][ny] - '0';
                if(dp[nx][ny][nk] > dp[x][y][k] + 1) {
                    dp[nx][ny][nk] = dp[x][y][k] + 1;
                    que.push({nx,ny,nk});
                }
            }
            else{
                if(dp[nx][ny][k] > dp[x][y][k] + 1) {
                    dp[nx][ny][k] = dp[x][y][k] + 1;
                    que.push({nx,ny,k});
                }
            }

        }
        
    }
    lint ans = INF64;
    rep(i, M+1) ans = min(ans, dp[gx][gy][i]);
    if(ans == INF64) ans = -1;
    cout << ans << endl;

}
0