結果
問題 | No.8063 幅優先探索 |
ユーザー | cotton_fn_ |
提出日時 | 2020-04-01 22:44:22 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,995 bytes |
コンパイル時間 | 12,763 ms |
コンパイル使用メモリ | 404,892 KB |
実行使用メモリ | 7,808 KB |
最終ジャッジ日時 | 2024-06-27 12:03:46 |
合計ジャッジ時間 | 13,713 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 28 ms
7,808 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
ソースコード
#![allow(unused)] use kyoproio::*; use std::{ collections::*, io::{self, prelude::*}, iter, mem::{replace, swap}, }; fn main() -> io::Result<()> { std::thread::Builder::new() .stack_size(50 * 1024 * 1024) .spawn(solve)? .join() .unwrap(); Ok(()) } fn solve() { let stdin = io::stdin(); let mut kin = KInput::new(stdin.lock()); let stdout = io::stdout(); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+) }; } macro_rules! outputln { ($($args:expr),+) => { output!($($args),+); outputln!() }; () => { output!("\n"); if cfg!(debug_assertions) { out.flush(); } } } let (r, c): (usize, usize) = kin.input(); let s: (usize, usize) = kin.input(); let g: (usize, usize) = kin.input(); let mut b = vec![vec![b'.'; c + 2]]; for _ in 0..r { let mut a = kin.bytes().to_owned(); a.insert(0, b'.'); a.push(b'.'); b.push(a); } b.push(vec![b'.'; c + 2]); let mut que = VecDeque::new(); que.push_back(s); let mut dist = vec![vec![!0; c + 2]; r + 2]; dist[s.0][s.1] = 0; while let Some((y, x)) = que.pop_front() { let (mut dx, mut dy) = (1, 0); for _ in 0..4 { let tx = (x as isize + dx) as usize; let ty = (y as isize + dy) as usize; if tx < c + 2 && ty < r + 2 && b[ty][tx] == b'.' && dist[ty][tx] == !0 { dist[ty][tx] = dist[y][x] + 1; que.push_back((ty, tx)); } swap(&mut dx, &mut dy); dx = -dx; } } outputln!("{}", dist[g.0][g.1]); } // ----------------------------------------------------------------------------- pub mod kyoproio { #![warn(unused)] use std::io::prelude::*; pub trait Input: Sized { fn str(&mut self) -> &str; fn bytes(&mut self) -> &[u8] { self.str().as_ref() } fn input<T: InputParse>(&mut self) -> T { self.input_fallible().expect("input error") } fn input_fallible<T: InputParse>(&mut self) -> Result<T> { T::input(self) } fn iter<T: InputParse>(&mut self) -> Iter<T, Self> { Iter { input: self, _t: std::marker::PhantomData, } } fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B { self.iter().take(n).collect() } } pub struct KInput<R> { src: R, buf: String, pos: usize, } impl<R: BufRead> KInput<R> { pub fn new(src: R) -> Self { Self { src, buf: String::with_capacity(1024), pos: 0, } } } impl<R: BufRead> Input for KInput<R> { fn str(&mut self) -> &str { loop { if self.pos >= self.buf.len() { self.pos = 0; self.buf.clear(); if self.src.read_line(&mut self.buf).expect("io error") == 0 { return &self.buf; } } let range = self.pos ..self.buf[self.pos..] .find(|c: char| c.is_ascii_whitespace()) .map(|i| i + self.pos) .unwrap_or_else(|| self.buf.len()); self.pos = range.end + 1; if range.end > range.start { return &self.buf[range]; } } } } pub struct Iter<'a, T, I> { input: &'a mut I, _t: std::marker::PhantomData<T>, } impl<'a, T: InputParse, I: Input> Iterator for Iter<'a, T, I> { type Item = T; fn next(&mut self) -> Option<Self::Item> { Some(self.input.input()) } } type Result<T> = std::result::Result<T, Box<dyn std::error::Error + 'static>>; pub trait InputParse: Sized { fn input<I: Input>(input: &mut I) -> Result<Self>; } macro_rules! from_str_impls { { $($T:ty)* } => { $(impl InputParse for $T { fn input<I: Input>(input: &mut I) -> Result<Self> { input.str().parse::<$T>().map_err(|e| e.into()) } })* }; } from_str_impls! { String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128 } macro_rules! tuple_impls { ($H:ident $($T:ident)*) => { impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) { fn input<I: Input>(input: &mut I) -> Result<Self> { Ok(($H::input(input)?, $($T::input(input)?),*)) } } tuple_impls!($($T)*); }; () => {}; } tuple_impls!(A B C D E F G); }