結果
問題 |
No.3199 Key-Door Grid
|
ユーザー |
![]() |
提出日時 | 2025-07-12 00:51:27 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 144 ms / 3,000 ms |
コード長 | 6,764 bytes |
コンパイル時間 | 4,558 ms |
コンパイル使用メモリ | 303,052 KB |
実行使用メモリ | 21,504 KB |
最終ジャッジ日時 | 2025-07-12 00:51:35 |
合計ジャッジ時間 | 8,400 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 37 |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include<bits/stdc++.h> #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p){ os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p){ is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v){ int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; } void in() {} template <typename T, class... U> void in(T &t, U &...u){ cin >> t; in(u...); } void out() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void out(const T &t, const U &...u){ cout << t; if (sizeof...(u)) cout << sep; out(u...); } template<typename T> void out(const vector<vector<T>> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" #line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << std::min(n, m); } template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template<typename T> T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0); } template<typename T> T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0); } template<typename T> void uniq(std::vector<T> &v){ std::sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int,int>; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" #line 2 "/Users/noya2/Desktop/Noya2_library/graph/grid.hpp" #line 5 "/Users/noya2/Desktop/Noya2_library/graph/grid.hpp" #include <ranges> namespace noya2 { struct grid { int h, w; grid (int _h = 0, int _w = 0) : h(_h), w(_w) {} int idx(int x, int y) const { return x * w + y; } std::pair<int,int> pos(int id) const { return {id / w, id % w}; } bool operator()(int x, int y) const { return 0 <= x && x < h && 0 <= y && y < w; } bool operator()(int id) const { return operator()(id / w, id % w); } static constexpr std::array<std::pair<int,int>, 4> dxys = {std::pair<int,int>{0, 1}, {-1, 0}, {0, -1}, {1, 0}}; auto adj4(int x, int y) const { return dxys | std::views::transform([x, y](std::pair<int,int> dxy){ return std::pair<int,int>(dxy.first + x, dxy.second + y); }) | std::views::filter([this](std::pair<int,int> xy){ return operator()(xy.first, xy.second); }); } auto adj4(int id) const { return adj4(id / w, id % w) | std::ranges::views::transform([this](std::pair<int,int> xy){ return idx(xy.first, xy.second); }); } }; } // namespace noya2 #line 4 "c.cpp" void solve(){ int h, w, m; in(h,w,m); vector<string> a(h); in(a); grid g(h,w); int sx = -1, sy = -1; int gx = -1, gy = -1; rep(i,h) rep(j,w){ if (a[i][j] == 'S'){ sx = i, sy = j; } if (a[i][j] == 'G'){ gx = i, gy = j; } } queue<tuple<int,int,int>> que; vector dist(h,vector(w,vector<int>(m+1,iinf))); dist[sx][sy][m] = 0; que.emplace(sx,sy,m); while (!que.empty()){ auto [i, j, k] = que.front(); que.pop(); for (auto [ni, nj] : g.adj4(i,j)){ if (a[ni][nj] == '#') continue; if ('a' <= a[ni][nj] && a[ni][nj] <= 'i'){ if ((int)(a[ni][nj] - 'a') != k) continue; } int nk = k; if ('1' <= a[ni][nj] && a[ni][nj] <= '9'){ nk = a[ni][nj] - '1'; } if (chmin(dist[ni][nj][nk],dist[i][j][k]+1)){ que.emplace(ni,nj,nk); } } } int ans = iinf; rep(i,m+1){ chmin(ans,dist[gx][gy][i]); } if (ans == iinf){ out(-1); return ; } out(ans); } int main(){ int t = 1; //in(t); while (t--) { solve(); } }