結果
| 問題 |
No.3199 Key-Door Grid
|
| コンテスト | |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2025-07-11 21:59:09 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 132 ms / 3,000 ms |
| コード長 | 5,181 bytes |
| コンパイル時間 | 21,045 ms |
| コンパイル使用メモリ | 379,136 KB |
| 実行使用メモリ | 21,120 KB |
| 最終ジャッジ日時 | 2025-07-11 21:59:51 |
| 合計ジャッジ時間 | 24,948 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 37 |
コンパイルメッセージ
warning: variable does not need to be mutable
--> src/main.rs:119:9
|
119 | let mut vec: Vec<i64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
|
= note: `#[warn(unused_mut)]` on by default
warning: variable does not need to be mutable
--> src/main.rs:125:9
|
125 | let mut vec: Vec<i64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:130:9
|
130 | let mut vec: Vec<usize> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:136:9
|
136 | let mut vec: Vec<f64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:141:9
|
141 | let mut vec: Vec<char> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:146:9
|
146 | let mut vec: Vec<usize> = read_vec();
| ----^^^
| |
| help: remove this `mut`
ソースコード
// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::io::BufRead;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;
// use proconio::input;
// const MOD: i64 = INF;
use cmp::Ordering::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;
macro_rules! p {
($x:expr) => {
//if expr
println!("{}", $x);
};
}
macro_rules! vp {
// vector print separate with space
($x:expr) => {
println!(
"{}",
$x.iter()
.map(|x| x.to_string())
.collect::<Vec<_>>()
.join(" ")
);
};
}
macro_rules! d {
($x:expr) => {
eprintln!("{:?}", $x);
};
}
macro_rules! yn {
($val:expr) => {
if $val {
println!("Yes");
} else {
println!("No");
}
};
}
macro_rules! map{
// declear btreemap
($($key:expr => $val:expr),*) => {
{
let mut map = ::std::collections::BTreeMap::new();
$(
map.insert($key, $val);
)*
map
}
};
}
macro_rules! set{
// declear btreemap
($($key:expr),*) => {
{
let mut set = ::std::collections::BTreeSet::new();
$(
set.insert($key);
)*
set
}
};
}
//input output
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
let mut s = String::new();
std::io::stdin().read_line(&mut s).ok();
s.trim().parse().ok().unwrap()
}
#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
read::<String>()
.split_whitespace()
.map(|e| e.parse().ok().unwrap())
.collect()
}
#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
(0..n).map(|_| read_vec()).collect()
}
#[allow(dead_code)]
fn readii() -> (i64, i64) {
let mut vec: Vec<i64> = read_vec();
(vec[0], vec[1])
}
#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
let mut vec: Vec<i64> = read_vec();
(vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
let mut vec: Vec<usize> = read_vec();
(vec[0], vec[1])
}
#[allow(dead_code)]
fn readff() -> (f64, f64) {
let mut vec: Vec<f64> = read_vec();
(vec[0], vec[1])
}
fn readcc() -> (char, char) {
let mut vec: Vec<char> = read_vec();
(vec[0], vec[1])
}
fn readuuu() -> (usize, usize, usize) {
let mut vec: Vec<usize> = read_vec();
(vec[0], vec[1], vec[2])
}
fn main() {
let (h, w, m) = readuuu();
let mut s = vec![String::new(); h];
for i in 0..h {
s[i] = read::<String>();
}
let mut sr = 0;
let mut sc = 0;
let mut gr = 0;
let mut gc = 0;
for i in 0..h {
let row: Vec<char> = s[i].chars().collect();
for j in 0..w {
if row[j] == 'S' {
sr = i;
sc = j;
}
if row[j] == 'G' {
gr = i;
gc = j;
}
}
}
let mut dist = vec![vec![vec![-1; m + 1]; w]; h];
let mut dq = VecDeque::new();
dist[sr][sc][0] = 0;
dq.push_back((sr, sc, 0));
let dr = [-1, 1, 0, 0];
let dc = [0, 0, -1, 1];
let mut cmat = vec![vec!['#'; w + 2]; h + 2];
for i in 0..h {
for j in 0..w {
cmat[i + 1][j + 1] = s[i].chars().nth(j).unwrap();
}
}
while let Some((r, c, k)) = dq.pop_front() {
let d = dist[r][c][k];
if r == gr && c == gc {
p!(d);
return;
}
for di in 0..4 {
let nr = r as isize + dr[di];
let nc = c as isize + dc[di];
if nr < 0 || nr >= h as isize || nc < 0 || nc >= w as isize {
continue;
}
let nr = nr as usize;
let nc = nc as usize;
let ch = cmat[nr + 1][nc + 1];
if ch == '#' {
continue;
}
let mut nk = k;
if ch >= '1' && ch <= '9' {
let key_id = (ch as u8 - b'0') as usize;
if key_id <= m {
nk = key_id;
} else {
continue;
}
} else if ch >= 'a' && ch <= 'i' {
let door_id = (ch as u8 - b'a') as usize + 1;
if door_id > m || k != door_id {
continue;
}
}
if dist[nr][nc][nk] == -1 {
dist[nr][nc][nk] = d + 1;
dq.push_back((nr, nc, nk));
}
}
}
p!(-1);
}