結果

問題 No.2387 Yokan Factory
ユーザー naut3
提出日時 2023-08-26 01:56:49
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 505 ms / 5,000 ms
コード長 3,267 bytes
コンパイル時間 18,981 ms
コンパイル使用メモリ 391,692 KB
実行使用メモリ 13,816 KB
最終ジャッジ日時 2024-12-24 15:02:37
合計ジャッジ時間 24,509 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

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

#![allow(non_snake_case, unused_imports, unused_must_use)]
use std::cmp::Reverse;
use std::io::{self, prelude::*};
use std::str;
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>()
        };
        ($T: ty, $N: expr) => {
            (0..$N).map(|_| scan.token::<$T>()).collect::<Vec<_>>()
        };
    }
    let (N, M, X) = (input!(usize), input!(usize), input!(usize));
    let mut graph = vec![vec![]; N];
    for _ in 0..M {
        let (u, v, a, b) = (
            input!(usize) - 1,
            input!(usize) - 1,
            input!(usize),
            input!(usize),
        );
        graph[u].push((v, a, b));
        graph[v].push((u, a, b));
    }
    // まず大きさを無視して運べるのかを判定したい
    const INF: usize = 1 << 60;
    let mut dist = vec![INF; N];
    let mut seen = vec![false; N];
    let mut hq = std::collections::BinaryHeap::new();
    hq.push((Reverse(0), 0));
    dist[0] = 0;
    while let Some((_, now)) = hq.pop() {
        if seen[now] {
            continue;
        }
        for &(nxt, a, _) in graph[now].iter() {
            if dist[nxt] > dist[now] + a {
                dist[nxt] = dist[now] + a;
                hq.push((Reverse(dist[nxt]), nxt));
            }
        }
        seen[now] = true;
    }
    if dist[N - 1] > X {
        writeln!(out, "-1");
        return;
    }
    // 適当に最大値を求める
    let mut ok = 0;
    let mut ng = 1 << 30;
    while ng - ok > 1 {
        let m = (ok + ng) / 2;
        let mut dist = vec![INF; N];
        let mut seen = vec![false; N];
        let mut hq = std::collections::BinaryHeap::new();
        hq.push((Reverse(0), 0));
        dist[0] = 0;
        while let Some((_, now)) = hq.pop() {
            if seen[now] {
                continue;
            }
            for &(nxt, a, b) in graph[now].iter() {
                if dist[nxt] > dist[now] + a && b >= m {
                    dist[nxt] = dist[now] + a;
                    hq.push((Reverse(dist[nxt]), nxt));
                }
            }
            seen[now] = true;
        }
        if dist[N - 1] <= X {
            ok = m;
        } else {
            ng = m;
        }
    }
    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