結果
問題 |
No.1473 おでぶなおばけさん
|
ユーザー |
![]() |
提出日時 | 2021-04-09 21:49:20 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 89 ms / 2,000 ms |
コード長 | 3,568 bytes |
コンパイル時間 | 15,809 ms |
コンパイル使用メモリ | 378,868 KB |
実行使用メモリ | 17,736 KB |
最終ジャッジ日時 | 2024-06-25 05:01:39 |
合計ジャッジ時間 | 19,119 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 47 |
コンパイルメッセージ
warning: unused variable: `i` --> src/main.rs:22:9 | 22 | for i in 0..m { | ^ help: if this is intentional, prefix it with an underscore: `_i` | = note: `#[warn(unused_variables)]` on by default warning: method `get_size` is never used --> src/main.rs:118:8 | 95 | impl UnionFindTree { | ------------------ method in this implementation ... 118 | fn get_size(&mut self, x: usize) -> usize { | ^^^^^^^^ | = note: `#[warn(dead_code)]` on by default
ソースコード
#![allow(unused_imports)] use std::cmp::*; use std::collections::*; use std::io::Write; use std::ops::Bound::*; #[allow(unused_macros)] macro_rules! debug { ($($e:expr),*) => { #[cfg(debug_assertions)] $({ let (e, mut err) = (stringify!($e), std::io::stderr()); writeln!(err, "{} = {:?}", e, $e).unwrap() })* }; } fn main() { let v = read_vec::<usize>(); let (n, m) = (v[0], v[1]); let mut edges = vec![]; for i in 0..m { let v = read_vec::<i64>(); let (a, b, d) = (v[0] as usize - 1, v[1] as usize - 1, v[2]); edges.push((d, a, b)); } edges.sort(); edges.reverse(); let mut uft = UnionFindTree::new(n); let mut max_w = 0; for &(d, a, b) in &edges { uft.unite(a, b); if uft.same(0, n - 1) { max_w = d; break; } } let mut graph = vec![vec![]; n]; for &(d, a, b) in &edges { if d >= max_w { graph[a].push((b, 1)); graph[b].push((a, 1)); } } let d = solve(&graph, 0); println!("{} {}", max_w, d[n - 1]); } fn read<T: std::str::FromStr>() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } fn read_vec<T: std::str::FromStr>() -> Vec<T> { read::<String>() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() } type Cost = i64; const INF: Cost = 100000_00000_00000; fn solve(edges: &Vec<Vec<(usize, Cost)>>, start_idx: usize) -> Vec<Cost> { let num_apexes = edges.len(); let mut d = vec![INF; num_apexes]; d[start_idx] = 0; let mut que = std::collections::BinaryHeap::new(); que.push((std::cmp::Reverse(0), start_idx)); while let Some((u, v)) = que.pop() { if d[v] < u.0 { continue; } for e in &edges[v] { if d[v] != INF && d[e.0] > d[v] + e.1 { d[e.0] = d[v] + e.1; que.push((std::cmp::Reverse(d[e.0]), e.0)); } } } d } #[derive(Debug, Clone)] struct UnionFindTree { parent: Vec<isize>, size: Vec<usize>, height: Vec<u64>, } impl UnionFindTree { fn new(n: usize) -> UnionFindTree { UnionFindTree { parent: vec![-1; n], size: vec![1usize; n], height: vec![0u64; n], } } fn find(&mut self, index: usize) -> usize { if self.parent[index] == -1 { return index; } let idx = self.parent[index] as usize; let ret = self.find(idx); self.parent[index] = ret as isize; ret } fn same(&mut self, x: usize, y: usize) -> bool { self.find(x) == self.find(y) } fn get_size(&mut self, x: usize) -> usize { let idx = self.find(x); self.size[idx] } fn unite(&mut self, index0: usize, index1: usize) -> bool { let a = self.find(index0); let b = self.find(index1); if a == b { false } else { if self.height[a] > self.height[b] { self.parent[b] = a as isize; self.size[a] += self.size[b]; } else if self.height[a] < self.height[b] { self.parent[a] = b as isize; self.size[b] += self.size[a]; } else { self.parent[b] = a as isize; self.size[a] += self.size[b]; self.height[a] += 1; } true } } }