結果

問題 No.3199 Key-Door Grid
ユーザー sgfc
提出日時 2025-07-11 22:12:30
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 199 ms / 3,000 ms
コード長 5,219 bytes
コンパイル時間 11,041 ms
コンパイル使用メモリ 546,724 KB
実行使用メモリ 27,136 KB
最終ジャッジ日時 2025-07-11 22:13:00
合計ジャッジ時間 14,167 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC optimize("O3")

#include "bits/stdc++.h"
#include <stdio.h>
#include "atcoder/all"
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;
const double eps = 1e-9;

#define OVERLOAD3(_1, _2, _3, call,...) call
#define REP0(n) for (ll i = 0; i < ll(n); ++i)
#define REP1(i, n) for (ll i = 0; i < ll(n); ++i)
#define REP2(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)
#define RREP0(n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP1(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP2(i, a, b) for (ll i = ll(a) - 1; i >= b; --i)
#define RREP(...) OVERLOAD3(__VA_ARGS__, RREP2, RREP1, RREP0)(__VA_ARGS__)
#define REPE(i, c) for (auto&& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

template<class... T> void COMMON_IN(T&... a) { (cin >> ... >> a); }
#define LI(...) ll __VA_ARGS__; COMMON_IN(__VA_ARGS__);
#define SI(...) string __VA_ARGS__; COMMON_IN(__VA_ARGS__);

using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define DLI(a, n) deque<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m) vector<vector<ll>> a(n, vector<ll>(m)); for(auto& x : a) for(auto& y : x) cin >> y;
using vd = vector<double>; using pl = pair<ll, ll>; using vpl = vector<pl>; using vvpl = vector<vpl>;

struct uv { ll u; ll v; };
struct uvc { ll u; ll v; ll c = 1; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uvc> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].emplace_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v); ret[x.v].emplace_back(x.u); } return ret; }
vvpl to_edge_d(const ll n, const vector<uvc>& v) { vvpl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v, x.c); ret[x.v].emplace_back(x.u, x.c); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

ostream& operator<<(ostream& os, const mint& v) { os << v.val(); return os; }
void yn(bool f) { std::cout << (f ? "Yes" : "No") << "\n"; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 61; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
void sort(auto& v) { std::ranges::sort(v); };
void rev(auto& v) { std::ranges::reverse(v); };
template<class T> auto p_sum(const T& v) { T ret(v.size()); std::partial_sum(begin(v), end(v), ret.begin()); return ret; };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }

//セグ木(max)
ll op(ll a, ll b) { return max(a, b); }
ll e() { return -llhuge; }
using st = segtree<ll, op, e>;

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	LI(h, w, m);
	VSI(s, h);

	pl sp, gp;
	REP(i, h) REP(j, w) {
		if (s[i][j] == 'S') {
			sp = { i, j };
		} else if (s[i][j] == 'G') {
			gp = { i, j };
		}
	}

	vl d = { 0, 1, 0, -1, 0};

	vvvl dist(11, vvl(h, vl(w, -1)));
	dist[0][sp.first][sp.second] = 0;
	queue<tuple<ll, ll, ll>> que;
	que.emplace(0, sp.first, sp.second);
	while(!que.empty()) {
		auto [k, i, j] = que.front();
		que.pop();
		for (int d1 = 0; d1 < 4; d1++) {
			ll ni = i + d[d1];
			ll nj = j + d[d1 + 1];
			ll nk = k;
			if (ni < 0 || ni >= h || nj < 0 || nj >= w || s[ni][nj] == '#') continue;
			if ('1' <= s[ni][nj] && s[ni][nj] <= '9') {
				nk = s[ni][nj] - '0';
			}
			if ('a' <= s[ni][nj] && s[ni][nj] <= 'z') {
				if (s[ni][nj] - 'a' != k - 1) continue; // 違う鍵なら進めない
			}

			if (dist[nk][ni][nj] != -1) continue;
			dist[nk][ni][nj] = dist[k][i][j] + 1;
			que.emplace(nk, ni, nj);
		}
	}

	ll ans = llhuge;
	REP(i, 11) {
		if (dist[i][gp.first][gp.second] == -1) continue; // ゴールに到達できない
		chmin(ans, dist[i][gp.first][gp.second]);
	}
	if (ans == llhuge) {
		cout << -1 << "\n";
	} else {
		cout << ans << "\n";
	}


 }

0