結果
問題 | No.659 徘徊迷路 |
ユーザー | cotton_fn_ |
提出日時 | 2020-04-06 19:31:41 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 14 ms / 2,000 ms |
コード長 | 5,824 bytes |
コンパイル時間 | 14,806 ms |
コンパイル使用メモリ | 385,928 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-06 21:52:48 |
合計ジャッジ時間 | 16,066 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 7 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 8 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 6 ms
5,376 KB |
testcase_09 | AC | 12 ms
5,376 KB |
testcase_10 | AC | 14 ms
5,376 KB |
testcase_11 | AC | 13 ms
5,376 KB |
testcase_12 | AC | 3 ms
5,376 KB |
testcase_13 | AC | 12 ms
5,376 KB |
testcase_14 | AC | 12 ms
5,376 KB |
testcase_15 | AC | 13 ms
5,376 KB |
testcase_16 | AC | 14 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 (n, m, mut t): (usize, usize, i64) = kin.input(); let (s, g): ((usize, usize), (usize, usize)) = kin.input(); let mut b = Vec::new(); for _ in 0..n { b.push(kin.bytes().to_owned()); } let mut a = vec![[0.; N]; (n - 2) * (m - 2)]; let idx = |i, j| (m - 2) * (i - 1) + j - 1; let ds = [(1, 0), (0, 1), (-1, 0), (0, -1)]; for i in 1..n - 1 { for j in 1..m - 1 { let mut cnt = 0; for &(di, dj) in &ds { let ti = (i as isize + di) as usize; let tj = (j as isize + dj) as usize; if b[ti][tj] == b'.' { cnt += 1; } } if cnt == 0 { a[idx(i, j)][idx(i, j)] = 1.; } for &(di, dj) in &ds { let ti = (i as isize + di) as usize; let tj = (j as isize + dj) as usize; if b[ti][tj] == b'.' { a[idx(i, j)][idx(ti, tj)] = 1. / cnt as f64; } } } } let mut b = id(a.len()); while t > 0 { if t & 1 == 1 { b = mul(&b, &a); } a = mul(&a, &a); t >>= 1; } outputln!("{}", b[idx(s.0, s.1)][idx(g.0, g.1)]); } const N: usize = 64; fn id(n: usize) -> Vec<[f64; N]> { let mut a = vec![[0.; N]; n]; for i in 0..n { a[i][i] = 1.; } a } fn mul(a: &[[f64; N]], b: &[[f64; N]]) -> Vec<[f64; N]> { let n = a.len(); let mut c = vec![[0.; N]; n]; for i in 0..n { for j in 0..n { for k in 0..n { c[i][j] += a[i][k] * b[k][j]; } } } c } // ----------------------------------------------------------------------------- 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::Err> { 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<*const 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()) } } pub trait InputParse: Sized { type Err: std::fmt::Debug; fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err>; } macro_rules! from_str_impls { { $($T:ty)* } => { $(impl InputParse for $T { type Err = <$T as std::str::FromStr>::Err; fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err> { input.str().parse::<$T>() } })* }; } 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),*) { type Err = (); fn input<I: Input>(input: &mut I) -> Result<Self, Self::Err> { // ? Ok(($H::input(input).unwrap(), $($T::input(input).unwrap()),*)) } } tuple_impls!($($T)*); }; () => {}; } tuple_impls!(A B C D E F G); }