結果

問題 No.3199 Key-Door Grid
コンテスト
ユーザー 👑 ArcAki
提出日時 2025-07-11 22:01:30
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 187 ms / 3,000 ms
コード長 5,258 bytes
コンパイル時間 13,489 ms
コンパイル使用メモリ 390,068 KB
実行使用メモリ 13,440 KB
最終ジャッジ日時 2025-07-11 22:01:57
合計ジャッジ時間 16,252 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff # 

pub trait SortD{ fn sort_d(&mut self); }
impl<T: Ord> SortD for Vec<T>{ fn sort_d(&mut self) {
    self.sort_by(|u, v| v.cmp(&u));
} }
pub trait Mx{fn max(&self, rhs: Self)->Self;}
impl Mx for f64{ fn max(&self, rhs: Self)->Self{if *self < rhs{ rhs } else { *self } }}
pub trait Mi{ fn min(&self, rhs: Self)->Self; }
impl Mi for f64{ fn min(&self, rhs: Self)->Self{ if *self < rhs{ rhs } else { *self } } }
pub fn chmax<T: PartialOrd+Clone>(a: &mut T, b: &T){ if *a < *b{ *a = b.clone(); } }
pub fn chmin<T: PartialOrd+Clone>(a: &mut T, b: &T){ if *a > *b{ *a = b.clone(); } }
pub fn gcd(mut a: i64, mut b: i64)->i64{ if b==0{return a;}(a,b)=(a.abs(),b.abs());while b!=0{ let c = a;a = b;b = c%b; }a }
pub fn factorial_i64(n: usize)->(Vec<i64>, Vec<i64>){ let mut res = vec![1; n+1];let mut inv = vec![1; n+1];for i in 0..n{ res[i+1] = (res[i]*(i+1)as i64)%MOD; }inv[n] = mod_inverse(res[n], MOD);for i in (0..n).rev(){ inv[i] = inv[i+1]*(i+1) as i64%MOD; }(res, inv) }
pub fn floor(a:i64, b:i64)->i64{let res=(a%b+b)%b;(a-res)/b}
pub fn extended_gcd(a:i64,b:i64)->(i64,i64,i64)
{if b==0{(a,1,0)}else{let(g,x,y)=extended_gcd(b,a%b);(g,y,x-floor(a,b)*y)}}
pub fn mod_inverse(a:i64,m:i64)->i64{let(_,x,_) =extended_gcd(a,m);(x%m+m)%m}
pub fn comb(a: i64, b: i64, f: &Vec<(i64, i64)>)->i64{
    if a<b{return 0;}else if b==0 || a==b{ return 1; }
    else{let x=f[a as usize].0;
        let y=f[(a-b) as usize].1;let z=f[b as usize].1;return((x*y)%MOD)*z%MOD;}}
pub fn factorial(x: i64)->Vec<(i64, i64)>{
    let mut f=vec![(1i64,1i64),(1, 1)];let mut z = 1i64;
    let mut inv = vec![0; x as usize+10];inv[1] = 1;
    for i in 2..x+1{z=(z*i)%MOD;
        let w=(MOD-inv[(MOD%i)as usize]*(MOD/i)%MOD)%MOD;
        inv[i as usize] = w;
        f.push((z, (f[i as usize-1].1*w)%MOD));}return f;}
pub fn fast_mod_pow(x: i64,p: usize, m: i64)->i64{
    let mut res=1;let mut t=x;let mut z=p;while z > 0{
        if z%2==1{res = (res*t)%m;}t = (t*t)%m;z /= 2; }res}
#[allow(unused_imports)]
use std::{
    convert::{Infallible, TryFrom, TryInto as _}, fmt::{self, Debug, Display, Formatter,},
    fs::{File}, hash::{Hash, Hasher}, iter::{Product, Sum}, marker::PhantomData,
    ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, RangeBounds},
    str::FromStr, sync::{atomic::{self, AtomicU32, AtomicU64}, Once},
    collections::{*, btree_set::Range, btree_map::Range as BTreeRange}, mem::{swap},
    cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
    thread::LocalKey, f64::consts::PI, time::Instant, cell::RefCell,
    io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write},
};
#[allow(unused_imports)]
use proconio::{input, input_interactive, marker::{*}};
#[allow(unused_imports)]
//use rand::{thread_rng, Rng, seq::SliceRandom, prelude::*};
#[allow(unused_imports)]
//use itertools::Itertools;
#[allow(unused_imports)]
//use ordered_float::OrderedFloat;
#[allow(unused_imports)]
//use ac_library::{*, ModInt998244353 as mint};
#[allow(dead_code)]
//type MI = StaticModInt<Mod998244353>;pub fn factorial_mint(n: usize)->(Vec<MI>, Vec<MI>){ let mut res = vec![mint::new(1); n+1];let mut inv = vec![mint::new(1); n+1];for i in 0..n{res[i+1] = res[i]*(i+1);}inv[n] = mint::new(1)/res[n];for i in (0..n).rev(){inv[i] = inv[i+1]*(i+1);}(res, inv)}

#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];
#[allow(dead_code)]
const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !0)];

//use proconio::fastout;
//#[fastout]
fn main() {
    input!{
        h: usize, w: usize, m: usize,
        s: [Chars; h],
    }
    let mut dist = vec![vec![vec![1<<30; w]; h]; m+1];
    let mut stack = VecDeque::new();
    let (mut gx, mut gy) = (0, 0);
    for i in 0..h{
        for j in 0..w{
            if s[i][j]=='S'{
                stack.push_back((i, j, 0));
                dist[0][i][j] = 0;
            } else if s[i][j]=='G'{
                (gx, gy) = (i, j);
            }
        }
    }
    while let Some((u,v,f)) = stack.pop_front(){
        for &(dx, dy) in &D{
            let (nx, ny) = (u.wrapping_add(dx), v.wrapping_add(dy));
            if !(nx < h&&ny < w&&s[nx][ny]!='#'){continue;}
            if let Some(x) = s[nx][ny].to_digit(10){
                let np = x as usize;
                if dist[np][nx][ny] > dist[f][u][v]+1{
                    dist[np][nx][ny] = dist[f][u][v]+1;
                    stack.push_back((nx, ny, np));
                }
            } else if 'a' <= s[nx][ny] && s[nx][ny] <= 'i'{
                let need = (s[nx][ny]as u8-b'a'+1)as usize;
                if f==need&&dist[f][nx][ny] > dist[f][u][v]{
                    dist[f][nx][ny] = dist[f][u][v]+1;
                    stack.push_back((nx, ny, f));
                }
            } else if dist[f][nx][ny] > dist[f][u][v]+1{
                dist[f][nx][ny] = dist[f][u][v]+1;
                stack.push_back((nx, ny, f));
            }
        }
    }
    let mut ans = 1<<30;
    for i in 0..=m{
        ans = ans.min(dist[i][gx][gy]);
    }
    if ans==1<<30{
        println!("-1");
    } else {
        println!("{}", ans);
    }
}
0