結果
| 問題 |
No.1473 おでぶなおばけさん
|
| コンテスト | |
| ユーザー |
uw_yu1rabbit
|
| 提出日時 | 2021-04-09 22:53:59 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 526 ms / 2,000 ms |
| コード長 | 3,516 bytes |
| コンパイル時間 | 12,834 ms |
| コンパイル使用メモリ | 376,832 KB |
| 実行使用メモリ | 14,464 KB |
| 最終ジャッジ日時 | 2024-06-25 06:37:38 |
| 合計ジャッジ時間 | 20,520 ms |
|
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 47 |
コンパイルメッセージ
warning: variable does not need to be mutable
--> src/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: unused variable: `debu`
--> src/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
ソースコード
//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,
}
}
uw_yu1rabbit