結果
問題 |
No.3199 Key-Door Grid
|
ユーザー |
![]() |
提出日時 | 2025-07-28 18:28:15 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 958 ms / 3,000 ms |
コード長 | 2,458 bytes |
コンパイル時間 | 4,266 ms |
コンパイル使用メモリ | 257,916 KB |
実行使用メモリ | 150,264 KB |
最終ジャッジ日時 | 2025-07-28 18:28:36 |
合計ジャッジ時間 | 19,311 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 37 |
コンパイルメッセージ
In lambda function, inlined from ‘int main()’ at main.cpp:55:12: main.cpp:30:58: warning: ‘si’ may be used uninitialized [-Wmaybe-uninitialized] 30 | auto id = [&](int i, int j, int k) { return h*w*k + w*i + j; }; | ~^~ main.cpp: In function ‘int main()’: main.cpp:46:9: note: ‘si’ was declared here 46 | int si, sj, gi, gj; | ^~ In lambda function, inlined from ‘int main()’ at main.cpp:55:12: main.cpp:30:63: warning: ‘sj’ may be used uninitialized [-Wmaybe-uninitialized] 30 | auto id = [&](int i, int j, int k) { return h*w*k + w*i + j; }; | ^ main.cpp: In function ‘int main()’: main.cpp:46:13: note: ‘sj’ was declared here 46 | int si, sj, gi, gj; | ^~ In lambda function, inlined from ‘int main()’ at main.cpp:67:33: main.cpp:30:58: warning: ‘gi’ may be used uninitialized [-Wmaybe-uninitialized] 30 | auto id = [&](int i, int j, int k) { return h*w*k + w*i + j; }; | ~^~ main.cpp: In function ‘int main()’: main.cpp:46:17: note: ‘gi’ was declared here 46 | int si, sj, gi, gj; | ^~ main.cpp:46:21: warning: ‘gj’ may be used uninitialized [-Wmaybe-uninitialized] 46 | int si, sj, gi, gj; | ^~
ソースコード
#ifndef ONLINE_JUDGE #define _GLIBCXX_DEBUG #endif #include <bits/stdc++.h> #include <cassert> #include <atcoder/all> using namespace std; using namespace atcoder; using ll = long long; using mint = modint998244353; //using mint = modint1000000007; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++) #define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--) #define all(v) v.begin(), v.end() void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); } #define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); } template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; } template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; } template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; } template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; } const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0}; int main() { int h, w, m; cin >> h >> w >> m; m++; auto id = [&](int i, int j, int k) { return h*w*k + w*i + j; }; vector<string> s(h); cin >> s; vector<vector<int>> g(h*w*m); rep(i, h) rep(j, w) rep(k, m) rep(t, 4) { int ni = i + di[t]; int nj = j + dj[t]; int nk = k; if(ni < 0 || ni >= h || nj < 0 || nj >= w) continue; if(s[ni][nj] == '#') continue; if(s[ni][nj] >= 'a' && s[ni][nj] <= 'z' && s[ni][nj] != 'a' + k - 1) continue; if(s[ni][nj] >= '1' && s[ni][nj] <= '9') nk = s[ni][nj] - '0'; g[id(i, j, k)].push_back(id(ni, nj, nk)); } int si, sj, gi, gj; rep(i, h) rep(j, w) { if(s[i][j] == 'S') si = i, sj = j; if(s[i][j] == 'G') gi = i, gj = j; } const int INF = 1e9; vector<int> dist(h*w*m, INF); queue<int> wait; dist[id(si, sj, 0)] = 0; wait.push(id(si, sj, 0)); while(!wait.empty()) { int pos = wait.front(); wait.pop(); for(int to: g[pos]) { if(dist[to] < INF) continue; dist[to] = dist[pos] + 1; wait.push(to); } } int ans = INF; rep(k, m) chmin(ans, dist[id(gi, gj, k)]); cout << (ans < INF ? ans : -1) << endl; return 0; }