提出 #30714526

---

ソースコード 拡げる

use proconio::{input, marker::Chars, marker::Usize1};

const DIR: [(usize, usize); 4] = [
    (1, 1),
    (1, 1_usize.wrapping_neg()),
    (1_usize.wrapping_neg(), 1),
    (1_usize.wrapping_neg(), 1_usize.wrapping_neg()),
];
fn main() {
    input! {
        n: usize,
        a: (Usize1, Usize1),
        b: (Usize1, Usize1),
        s: [Chars; n],
    }
    if (a.0 + a.1) % 2 != (b.0 + b.1) % 2 {
        println!("-1");
        return;
    }
    let bfs = |sh: usize, sw: usize| -> i32 {
        let mut que = std::collections::VecDeque::new();
        let mut dist = vec![vec![-1; n]; n];
        dist[sh][sw] = 0;
        que.push_back((sh, sw));
        while !que.is_empty() {
            let v = que.pop_front().unwrap();
            for &(dh, dw) in DIR.iter() {
                for d in 1..n {
                    let nh = v.0 + d * dh;
                    let nw = v.1 + d * dw;
                    if n <= nh || n <= nw {
                        break;
                    }
                    if s[nh][nw] == '#' {
                        break;
                    }
                    if dist[nh][nw] != -1 {
                        continue;
                    }
                    dist[nh][nw] = dist[v.0][v.1] + 1;
                    if nh == b.0 && nw == b.1 {
                        return dist[b.0][b.1];
                    }
                    que.push_back((nh, nw));
                }
            }
        }
        dist[b.0][b.1]
    };
    println!("{}", bfs(a.0, a.1))
}

提出情報

ジャッジ結果