結果

問題 No.1473 おでぶなおばけさん
ユーザー uw_yu1rabbituw_yu1rabbit
提出日時 2021-04-09 22:53:59
言語 Rust
(1.77.0)
結果
AC  
実行時間 527 ms / 2,000 ms
コード長 3,516 bytes
コンパイル時間 2,033 ms
コンパイル使用メモリ 157,296 KB
実行使用メモリ 14,600 KB
最終ジャッジ日時 2023-09-07 12:33:00
合計ジャッジ時間 9,975 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 253 ms
13,764 KB
testcase_03 AC 118 ms
11,976 KB
testcase_04 AC 264 ms
8,540 KB
testcase_05 AC 55 ms
4,380 KB
testcase_06 AC 223 ms
12,248 KB
testcase_07 AC 203 ms
14,548 KB
testcase_08 AC 488 ms
14,600 KB
testcase_09 AC 218 ms
14,584 KB
testcase_10 AC 41 ms
8,468 KB
testcase_11 AC 45 ms
10,120 KB
testcase_12 AC 40 ms
9,292 KB
testcase_13 AC 27 ms
6,432 KB
testcase_14 AC 20 ms
5,044 KB
testcase_15 AC 39 ms
8,540 KB
testcase_16 AC 38 ms
7,712 KB
testcase_17 AC 4 ms
4,376 KB
testcase_18 AC 6 ms
4,376 KB
testcase_19 AC 52 ms
8,000 KB
testcase_20 AC 90 ms
10,912 KB
testcase_21 AC 104 ms
10,128 KB
testcase_22 AC 76 ms
11,984 KB
testcase_23 AC 66 ms
11,180 KB
testcase_24 AC 59 ms
10,392 KB
testcase_25 AC 527 ms
11,720 KB
testcase_26 AC 499 ms
11,724 KB
testcase_27 AC 65 ms
5,632 KB
testcase_28 AC 345 ms
14,336 KB
testcase_29 AC 128 ms
9,852 KB
testcase_30 AC 207 ms
11,192 KB
testcase_31 AC 207 ms
14,056 KB
testcase_32 AC 150 ms
12,716 KB
testcase_33 AC 130 ms
10,392 KB
testcase_34 AC 66 ms
6,424 KB
testcase_35 AC 42 ms
6,692 KB
testcase_36 AC 101 ms
8,480 KB
testcase_37 AC 273 ms
10,652 KB
testcase_38 AC 21 ms
4,380 KB
testcase_39 AC 39 ms
8,068 KB
testcase_40 AC 39 ms
8,048 KB
testcase_41 AC 39 ms
7,548 KB
testcase_42 AC 40 ms
7,608 KB
testcase_43 AC 87 ms
10,924 KB
testcase_44 AC 89 ms
10,988 KB
testcase_45 AC 89 ms
10,992 KB
testcase_46 AC 63 ms
9,564 KB
testcase_47 AC 91 ms
11,188 KB
testcase_48 AC 84 ms
10,928 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused variable: `debu`
  --> Main.rs:19:45
   |
19 | fn binary_search(g:&Vec<Vec<(usize,usize)>>,debu:&Vec<usize>) -> usize {
   |                                             ^^^^ help: if this is intentional, prefix it with an underscore: `_debu`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
 --> Main.rs:9:9
  |
9 |     let mut debu:Vec<usize> = vec![0;n];
  |         ----^^^^
  |         |
  |         help: remove this `mut`
  |
  = note: `#[warn(unused_mut)]` on by default

warning: 2 warnings emitted

ソースコード

diff # 

//use proconio::input;
fn main() {
    let t = std::io::stdin();
    let mut read = snio::Reader::new(t.lock());
    let n = read.usize();
    let m = read.usize();
    let road_and_dist:Vec<(usize,usize,usize)> = (0..m).map(|_| (read.usize(),read.usize(), read.usize())).collect();
    let mut g = vec![Vec::new();n];
    let mut debu:Vec<usize> = vec![0;n];

    for (s,t,u) in road_and_dist {
        g[s - 1].push((t - 1,u));
        g[t - 1].push((s - 1,u));

    }
    let t = binary_search(&g,&debu);
    println!("{} {}",t,dijkstra(&g,t,0));
}
fn binary_search(g:&Vec<Vec<(usize,usize)>>,debu:&Vec<usize>) -> usize {
    let (mut lb , mut ub) = (0,1e9 as usize + 1);
    while ub - lb > 1 {
        let mid = (ub + lb) / 2;
        if dijkstra(g,mid,0) != 1e18 as usize{
            lb = mid;
        } else {
            ub = mid;
        }
    }
    lb
}

use std::collections::BinaryHeap;
use std::cmp::Reverse;
fn dijkstra(g:& Vec<Vec<(usize,usize)>>,debu:usize,start:usize) -> usize{
    let mut pq = BinaryHeap::new();
    let mut dist = vec![1e18 as usize;g.len()];
    pq.push(Reverse((0,start)));
    dist[start] = 0;
    while let Some(v) = pq.pop() {
        let (cost,now) = v.0;
        for (to,c) in &g[now] {
            if dist[now] < cost || *c < debu{
                continue;
            }
            if dist[*to] > 1 + dist[now] {
                dist[*to] = dist[now] + 1;
                pq.push(Reverse((dist[*to],*to)));
            }
        }
    }
    //println!("{}",dist[g.len() - 1]);
    dist[g.len() - 1]
}

#[allow(dead_code)]
pub mod snio {
    pub struct Reader<R: std::io::BufRead> {
        reader: R,
        buf: std::collections::VecDeque<String>,
    }

    impl<R: std::io::BufRead> Reader<R> {
        pub fn new(reader: R) -> Self {
            Self {
                reader,
                buf: std::collections::VecDeque::new(),
            }
        }
        fn load(&mut self) {
            while self.buf.is_empty() {
                let mut s = String::new();
                let length = self.reader.read_line(&mut s).unwrap();
                if length == 0 {
                    break;
                }
                self.buf.extend(s.split_whitespace().map(|s| s.to_owned()));
            }
        }
        pub fn string(&mut self) -> String {
            self.load();
            self.buf.pop_front().unwrap_or_else(|| panic!("input ended"))
        }
        pub fn char(&mut self) -> char {
            let string = self.string();
            let mut chars = string.chars();
            let res = chars.next().unwrap();
            assert!(chars.next().is_none(), "invalid input!");
            res
        }
        pub fn chars(&mut self) -> Vec<char> {
            self.read::<String>().chars().collect()
        }
        pub fn read<T: std::str::FromStr>(&mut self) -> T
            where
                <T as ::std::str::FromStr>::Err: ::std::fmt::Debug,
        {
            self.string().parse::<T>().expect("Failed to parse the input.")
        }
    }
    macro_rules! definition_of_reader_of_numbers {
            ($($ty:tt,)*) => {
                impl <R:std::io::BufRead> Reader<R> {
                    $(
                    #[inline]
                    pub fn $ty (&mut self) -> $ty {
                        self.read::<$ty>()
                    }
                    )*
                }
            }
        }
    definition_of_reader_of_numbers! {
        u8,u16,u32,u64,usize,
        i8,i16,i32,i64,isize,
    }
}
0