結果

問題 No.2354 Poor Sight in Winter
ユーザー naut3
提出日時 2023-06-18 11:55:34
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 62 ms / 2,000 ms
コード長 3,087 bytes
コンパイル時間 22,541 ms
コンパイル使用メモリ 398,676 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-26 00:50:42
合計ジャッジ時間 24,585 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused `Result` that must be used
   --> src/main.rs:106:5
    |
106 |     writeln!(out, "{}", ok);
    |     ^^^^^^^^^^^^^^^^^^^^^^^
    |
    = note: this `Result` may be an `Err` variant, which should be handled
    = note: `#[warn(unused_must_use)]` on by default
    = note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info)

ソースコード

diff #
プレゼンテーションモードにする

#![allow(non_snake_case, unused_imports)]
use std::io::{self, prelude::*};
use std::str;
fn dist(x1: usize, y1: usize, x2: usize, y2: usize) -> usize {
    let mut ret = 0;
    if x1 < x2 {
        ret += x2 - x1;
    } else {
        ret += x1 - x2;
    }
    if y1 < y2 {
        ret += y2 - y1;
    } else {
        ret += y1 - y2;
    }
    ret
}
fn dijkstra(graph: &Vec<Vec<(usize, isize)>>, start: usize) -> Vec<isize> {
    let n = graph.len();
    const INF: isize = 1 << 60;
    let mut dist = vec![INF; n];
    let mut seen = vec![false; n];
    dist[start] = 0;
    let mut hq = std::collections::BinaryHeap::new();
    hq.push((-0, start));
    while let Some((_, now)) = hq.pop() {
        if seen[now] {
            continue;
        }
        for &(nxt, d) in graph[now].iter() {
            if dist[nxt] > dist[now] + d {
                dist[nxt] = dist[now] + d;
                hq.push((-dist[nxt], nxt));
            }
        }
        seen[now] = true;
    }
    return dist;
}
fn main() {
    let (stdin, stdout) = (io::stdin(), io::stdout());
    let mut scan = Scanner::new(stdin.lock());
    let mut out = io::BufWriter::new(stdout.lock());
    macro_rules! input {
        ($T: ty) => {
            scan.token::<$T>()
        };
    }
    let N = input!(usize);
    let K = input!(isize);
    let (sx, sy) = (input!(usize), input!(usize));
    let (gx, gy) = (input!(usize), input!(usize));
    let mut XY = vec![(sx, sy), (gx, gy)];
    for _ in 0..N {
        let (x, y) = (input!(usize), input!(usize));
        XY.push((x, y));
    }
    let mut ng = 0;
    let mut ok = 200_010;
    while ok - ng > 1 {
        let p = (ok + ng) / 2;
        let mut graph = vec![vec![]; N + 2];
        for i in 0..N + 2 {
            let (x1, y1) = XY[i];
            for j in 0..N + 2 {
                if i == j {
                    continue;
                }
                let (x2, y2) = XY[j];
                let d = dist(x1, y1, x2, y2);
                graph[i].push((j, ((d - 1) / p) as isize));
            }
        }
        let dist = dijkstra(&graph, 0)[1];
        if dist <= K {
            ok = p;
        } else {
            ng = p;
        }
    }
    writeln!(out, "{}", ok);
}
struct Scanner<R> {
    reader: R,
    buf_str: Vec<u8>,
    buf_iter: str::SplitWhitespace<'static>,
}
impl<R: BufRead> Scanner<R> {
    fn new(reader: R) -> Self {
        Self {
            reader,
            buf_str: vec![],
            buf_iter: "".split_whitespace(),
        }
    }
    fn token<T: str::FromStr>(&mut self) -> T {
        loop {
            if let Some(token) = self.buf_iter.next() {
                return token.parse().ok().expect("Failed parse");
            }
            self.buf_str.clear();
            self.reader
                .read_until(b'\n', &mut self.buf_str)
                .expect("Failed read");
            self.buf_iter = unsafe {
                let slice = str::from_utf8_unchecked(&self.buf_str);
                std::mem::transmute(slice.split_whitespace())
            }
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0