結果
問題 | No.1393 Median of Walk |
ユーザー | koba-e964 |
提出日時 | 2021-11-17 14:11:15 |
言語 | Rust (1.77.0 + proconio) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,003 bytes |
コンパイル時間 | 12,653 ms |
コンパイル使用メモリ | 395,716 KB |
実行使用メモリ | 395,912 KB |
最終ジャッジ日時 | 2024-06-06 02:35:28 |
合計ジャッジ時間 | 16,902 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
10,624 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | TLE | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
ソースコード
#[allow(unused_imports)] use std::cmp::*; #[allow(unused_imports)] use std::collections::*; use std::io::{Write, BufWriter}; // https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { ($($r:tt)*) => { let stdin = std::io::stdin(); let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock())); let mut next = move || -> String{ bytes.by_ref().map(|r|r.unwrap() as char) .skip_while(|c|c.is_whitespace()) .take_while(|c|!c.is_whitespace()) .collect() }; input_inner!{next, $($r)*} }; } macro_rules! input_inner { ($next:expr) => {}; ($next:expr,) => {}; ($next:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($next, $t); input_inner!{$next $($r)*} }; } macro_rules! read_value { ($next:expr, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) }; ($next:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>() }; ($next:expr, chars) => { read_value!($next, String).chars().collect::<Vec<char>>() }; ($next:expr, usize1) => (read_value!($next, usize) - 1); ($next:expr, [ $t:tt ]) => {{ let len = read_value!($next, usize); read_value!($next, [$t; len]) }}; ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error")); } trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); } impl<T: PartialOrd> Change for T { fn chmax(&mut self, x: T) { if *self < x { *self = x; } } fn chmin(&mut self, x: T) { if *self > x { *self = x; } } } fn main() { // In order to avoid potential stack overflow, spawn a new thread. let stack_size = 104_857_600; // 100 MB let thd = std::thread::Builder::new().stack_size(stack_size); thd.spawn(|| solve()).unwrap().join().unwrap(); } fn solve() { let out = std::io::stdout(); let mut out = BufWriter::new(out.lock()); macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););} input! { n: usize, m: usize, uvw: [(usize1, usize1, i64); m], } let mut uvw = uvw; uvw.sort_by_key(|x| x.2); let mut g = vec![vec![]; n]; for &(u, v, _) in &uvw { g[u].push((v, 1)); } const INF: i32 = 1 << 16; let mut h = vec![INF; n]; let mut que = VecDeque::new(); que.push_back((0, 0)); while let Some((d, v)) = que.pop_front() { if h[v] <= d { continue; } h[v] = d; for &(w, _) in &g[v] { que.push_back((d + 1, w)); } } let mut dist = vec![0; n]; let mut ans = vec![-1; n]; for &(u, v, w) in &uvw { g[u].push((v, -1)); let mut que = BinaryHeap::new(); que.push((Reverse(h[u] - 1 - h[v]), v)); loop { let mut found = false; while let Some((Reverse(d), a)) = que.pop() { if a == u && d < dist[u] { found = true; continue; } if dist[a] <= d { continue; } dist[a] = d; for &(w, c) in &g[a] { let nd = if d + h[a] == -INF { -INF - h[w] } else { d + c + h[a] - h[w] }; que.push((Reverse(nd), w)); } } if !found { break; } h[u] = -INF; dist[u] = 0; que.clear(); for &(w, _) in &g[u] { que.push((Reverse(-INF - h[w]), w)); } } for i in 0..n { h[i] += dist[i]; dist[i] = 0; } for i in 0..n { if ans[i] == -1 && h[i] <= 0 { ans[i] = w; } } } for i in 1..n { puts!("{}\n", ans[i]); } }