#930644 (Rust) No.20 砂漠のオアシス

• 問題: No.20 砂漠のオアシス
• ユーザー: Yukino DX.
• 提出日時: 2023-11-23 23:46:41
• 言語: Rust (1.77.0 + proconio)
• 結果: WA
• 実行時間: -
• コード長: 4,309 bytes
• コンパイル時間: 12,507 ms
• コンパイル使用メモリ: 400,940 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-09-26 08:24:39
• 合計ジャッジ時間: 13,852 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	17 ms; 5,376 KB
testcase_06	AC	17 ms; 5,376 KB
testcase_07	AC	17 ms; 5,376 KB
testcase_08	AC	16 ms; 5,376 KB
testcase_09	AC	16 ms; 5,376 KB
testcase_10	WA	-
testcase_11	AC	1 ms; 5,376 KB
testcase_12	WA	-
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	3 ms; 5,376 KB
testcase_20	AC	1 ms; 5,376 KB

ソースコード

#![allow(non_snake_case)]
#![allow(unused_imports)]
// use itertools::Itertools;
// use proconio::input;
// use proconio::marker::*;
use std::cmp::Reverse;
use std::collections::*;

fn main() {
    input! {
        n:usize,
        v:usize,
        ox:usize,
        oy:usize,
        l:[[usize;n];n],
    }

    let ans0 = dijkstra(&l, 0, 0, n - 1, n - 1) < v;
    let ans1 = if ox == 0 {
        false
    } else {
        let dist = dijkstra(&l, 0, 0, ox - 1, oy - 1);
        let hp = if dist < v { (v - dist) * 2 } else { 0 };

        hp > dijkstra(&l, ox - 1, oy - 1, n - 1, n - 1)
    };

    let ans = ans0 || ans1;
    println!("{}", if ans { "YES" } else { "NO" });
}

fn dijkstra(l: &Vec<Vec<usize>>, sx: usize, sy: usize, gx: usize, gy: usize) -> usize {
    let n = l.len();
    let gmgr = GridMgr::new(n, n);
    const INF: usize = std::usize::MAX;
    let mut dists = vec![vec![INF; n]; n];
    let mut pq = BinaryHeap::new();
    dists[sx][sy] = 0;

    pq.push(Reverse((dists[sx][sy], sx, sy)));
    while let Some(Reverse((dist, cx, cy))) = pq.pop() {
        if dists[cx][cy] < dist {
            continue;
        }

        for (nx, ny) in gmgr.neigh4((cx, cy)) {
            let ndist = dist + l[nx][ny];
            if ndist < dists[nx][ny] {
                dists[nx][ny] = ndist;
                pq.push(Reverse((ndist, nx, ny)));
            }
        }
    }

    dists[gx][gy]
}

use grid_mgr::*;
mod grid_mgr {
    pub const DIR4: [(usize, usize); 4] = [(1, 0), (0, !0), (!0, 0), (0, 1)];
    pub const DIR8: [(usize, usize); 8] = [
        (1, 0),
        (1, !0),
        (0, !0),
        (!0, !0),
        (!0, 0),
        (!0, 1),
        (0, 1),
        (1, 1),
    ];

    pub struct GridMgr {
        pub h: usize,
        pub w: usize,
    }

    impl GridMgr {
        #[allow(dead_code)]
        pub fn new(h: usize, w: usize) -> Self {
            Self { h, w }
        }

        #[allow(dead_code)]
        pub fn neigh4<'a>(
            &'a self,
            p: (usize, usize),
        ) -> impl Iterator<Item = (usize, usize)> + 'a {
            DIR4.iter().filter_map(move |&(dx, dy)| {
                let nx = p.0.wrapping_add(dx);
                let ny = p.1.wrapping_add(dy);
                if nx < self.h && ny < self.w {
                    Some((nx, ny))
                } else {
                    None
                }
            })
        }

        #[allow(dead_code)]
        pub fn neigh8<'a>(
            &'a self,
            p: (usize, usize),
        ) -> impl Iterator<Item = (usize, usize)> + 'a {
            DIR8.iter().filter_map(move |&(dx, dy)| {
                let nx = p.0.wrapping_add(dx);
                let ny = p.1.wrapping_add(dy);
                if nx < self.h && ny < self.w {
                    Some((nx, ny))
                } else {
                    None
                }
            })
        }
    }
}
mod input {
    #[macro_export]
    macro_rules! input {
        (source = $s:expr, $($r:tt)*) => {
            let mut iter = $s.split_whitespace();
            input_inner!{iter, $($r)*}
        };
        ($($r:tt)*) => {
            let s = {
                use std::io::Read;
                let mut s = String::new();
                std::io::stdin().read_to_string(&mut s).unwrap();
                s
            };
            let mut iter = s.split_whitespace();
            input_inner!{iter, $($r)*}
        };
    }

    #[macro_export]
    macro_rules! input_inner {
        ($iter:expr) => {};
        ($iter:expr, ) => {};

        ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
            let $var = read_value!($iter, $t);
            input_inner!{$iter $($r)*}
        };
    }

    #[macro_export]
    macro_rules! read_value {
        ($iter:expr, ( $($t:tt),* )) => {
            ( $(read_value!($iter, $t)),* )
        };

        ($iter:expr, [ $t:tt ; $len:expr ]) => {
            (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        };

        ($iter:expr, chars) => {
            read_value!($iter, String).chars().collect::<Vec<char>>()
        };

        ($iter:expr, usize1) => {
            read_value!($iter, usize) - 1
        };

        ($iter:expr, $t:ty) => {
            $iter.next().unwrap().parse::<$t>().expect("Parse error")
        };
    }
}