結果
問題 | No.1607 Kth Maximum Card |
ユーザー |
![]() |
提出日時 | 2021-07-16 21:55:03 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 1,942 ms / 3,500 ms |
コード長 | 3,132 bytes |
コンパイル時間 | 16,037 ms |
コンパイル使用メモリ | 403,248 KB |
実行使用メモリ | 31,628 KB |
最終ジャッジ日時 | 2024-07-06 09:02:41 |
合計ジャッジ時間 | 32,982 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
コンパイルメッセージ
warning: unused import: `std::io::Write` --> src/main.rs:72:5 | 72 | use std::io::Write; | ^^^^^^^^^^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: type alias `Map` is never used --> src/main.rs:75:6 | 75 | type Map<K, V> = BTreeMap<K, V>; | ^^^ | = note: `#[warn(dead_code)]` on by default warning: type alias `Set` is never used --> src/main.rs:76:6 | 76 | type Set<T> = BTreeSet<T>; | ^^^
ソースコード
// ---------- begin chmin, chmax ---------- pub trait ChangeMinMax { fn chmin(&mut self, x: Self) -> bool; fn chmax(&mut self, x: Self) -> bool; } impl<T: PartialOrd> ChangeMinMax for T { fn chmin(&mut self, x: Self) -> bool { *self > x && { *self = x; true } } fn chmax(&mut self, x: Self) -> bool { *self < x && { *self = x; true } } } // ---------- end chmin, chmax ---------- // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::<Vec<char>>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::<Vec<u8>>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- use std::io::Write; use std::collections::*; type Map<K, V> = BTreeMap<K, V>; type Set<T> = BTreeSet<T>; type Deque<T> = VecDeque<T>; fn run() { input! { n: usize, m: usize, k: u32, e: [(usize1, usize1, u32); m], } let valid = |m: u32| -> bool { let mut g = vec![vec![]; n]; for &(a, b, c) in e.iter() { let c = if c >= m {1} else {0}; g[a].push((b, c)); g[b].push((a, c)); } let mut dp = vec![k + 1; n]; dp[0] = 0; let mut deq = Deque::new(); deq.push_back(0); while let Some(v) = deq.pop_front() { let d = dp[v]; for &(u, c) in g[v].iter() { if c == 0 && dp[u].chmin(d) { deq.push_front(u); } if c == 1 && dp[u].chmin(d + 1) { deq.push_back(u); } } } dp[n - 1] < k }; let mut ng = 0; let mut ok = 200001; while ok - ng > 1 { let mid = (ok + ng) / 2; if valid(mid) { ok = mid; } else { ng = mid; } } println!("{}", ng); } fn main() { run(); }