結果
問題 | No.1320 Two Type Min Cost Cycle |
ユーザー | ikd |
提出日時 | 2020-12-17 20:28:21 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 474 ms / 2,000 ms |
コード長 | 4,038 bytes |
コンパイル時間 | 4,069 ms |
コンパイル使用メモリ | 184,584 KB |
実行使用メモリ | 4,372 KB |
最終ジャッジ日時 | 2023-10-21 07:06:48 |
合計ジャッジ時間 | 11,559 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,372 KB |
testcase_02 | AC | 0 ms
4,372 KB |
testcase_03 | AC | 1 ms
4,372 KB |
testcase_04 | AC | 1 ms
4,372 KB |
testcase_05 | AC | 1 ms
4,372 KB |
testcase_06 | AC | 1 ms
4,372 KB |
testcase_07 | AC | 49 ms
4,372 KB |
testcase_08 | AC | 69 ms
4,372 KB |
testcase_09 | AC | 394 ms
4,372 KB |
testcase_10 | AC | 86 ms
4,372 KB |
testcase_11 | AC | 327 ms
4,372 KB |
testcase_12 | AC | 147 ms
4,372 KB |
testcase_13 | AC | 219 ms
4,372 KB |
testcase_14 | AC | 11 ms
4,372 KB |
testcase_15 | AC | 102 ms
4,372 KB |
testcase_16 | AC | 44 ms
4,372 KB |
testcase_17 | AC | 31 ms
4,372 KB |
testcase_18 | AC | 26 ms
4,372 KB |
testcase_19 | AC | 195 ms
4,372 KB |
testcase_20 | AC | 9 ms
4,372 KB |
testcase_21 | AC | 267 ms
4,372 KB |
testcase_22 | AC | 1 ms
4,372 KB |
testcase_23 | AC | 1 ms
4,372 KB |
testcase_24 | AC | 1 ms
4,372 KB |
testcase_25 | AC | 1 ms
4,372 KB |
testcase_26 | AC | 1 ms
4,372 KB |
testcase_27 | AC | 1 ms
4,372 KB |
testcase_28 | AC | 28 ms
4,372 KB |
testcase_29 | AC | 323 ms
4,372 KB |
testcase_30 | AC | 1 ms
4,372 KB |
testcase_31 | AC | 52 ms
4,372 KB |
testcase_32 | AC | 1 ms
4,372 KB |
testcase_33 | AC | 333 ms
4,372 KB |
testcase_34 | AC | 148 ms
4,372 KB |
testcase_35 | AC | 16 ms
4,372 KB |
testcase_36 | AC | 12 ms
4,372 KB |
testcase_37 | AC | 3 ms
4,372 KB |
testcase_38 | AC | 25 ms
4,372 KB |
testcase_39 | AC | 5 ms
4,372 KB |
testcase_40 | AC | 1 ms
4,372 KB |
testcase_41 | AC | 1 ms
4,372 KB |
testcase_42 | AC | 1 ms
4,372 KB |
testcase_43 | AC | 236 ms
4,372 KB |
testcase_44 | AC | 112 ms
4,372 KB |
testcase_45 | AC | 474 ms
4,372 KB |
testcase_46 | AC | 61 ms
4,372 KB |
testcase_47 | AC | 217 ms
4,372 KB |
testcase_48 | AC | 261 ms
4,372 KB |
testcase_49 | AC | 30 ms
4,372 KB |
testcase_50 | AC | 1 ms
4,372 KB |
testcase_51 | AC | 1 ms
4,372 KB |
testcase_52 | AC | 39 ms
4,372 KB |
testcase_53 | AC | 23 ms
4,372 KB |
testcase_54 | AC | 203 ms
4,372 KB |
testcase_55 | AC | 204 ms
4,372 KB |
testcase_56 | AC | 204 ms
4,372 KB |
testcase_57 | AC | 317 ms
4,372 KB |
testcase_58 | AC | 317 ms
4,372 KB |
testcase_59 | AC | 317 ms
4,372 KB |
ソースコード
#[derive(Copy, Clone, Debug)] struct Edge { to: usize, cost: u64, } fn dijkstra(g: &Vec<Vec<Edge>>, start: usize) -> (Vec<u64>, Vec<Option<usize>>) { use std::cmp::Reverse; use std::collections::BinaryHeap; let n = g.len(); let mut d = vec![std::u64::MAX; n]; let mut q = BinaryHeap::new(); let mut prev = vec![None; n]; d[start] = 0; q.push((Reverse(0), start)); while let Some((Reverse(c), cur)) = q.pop() { if c > d[cur] { continue; } for e in &g[cur] { if c + e.cost < d[e.to] { d[e.to] = c + e.cost; prev[e.to] = Some(cur); q.push((Reverse(d[e.to]), e.to)); } } } (d, prev) } fn main() { let stdin = std::io::stdin(); let mut rd = ProconReader::new(stdin.lock()); let t: usize = rd.get(); let n: usize = rd.get(); let m: usize = rd.get(); let edges: Vec<(usize, usize, u64)> = (0..m) .map(|_| { let u: usize = rd.get(); let v: usize = rd.get(); let w: u64 = rd.get(); (u - 1, v - 1, w) }) .collect(); let solve0 = || { let mut ans = std::u64::MAX; for i in 0..m { let mut g = vec![vec![]; n]; for j in 0..m { if i == j { continue; } let (u, v, w) = edges[j]; g[u].push(Edge { to: v, cost: w }); g[v].push(Edge { to: u, cost: w }); } let (u, v, w) = edges[i]; let (d, _) = dijkstra(&g, v); ans = ans.min(d[u].saturating_add(w)); } ans }; let solve1 = || { let mut ans = std::u64::MAX; for i in 0..m { let mut g = vec![vec![]; n]; for j in 0..m { if i == j { continue; } let (u, v, w) = edges[j]; g[u].push(Edge { to: v, cost: w }); } let (u, v, w) = edges[i]; let (d, _) = dijkstra(&g, v); ans = ans.min(d[u].saturating_add(w)); } ans }; let ans = match t { 0 => solve0(), 1 => solve1(), _ => unreachable!(), }; if ans < std::u64::MAX { println!("{}", ans); } else { println!("{}", -1); } } pub struct ProconReader<R> { r: R, line: String, i: usize, } impl<R: std::io::BufRead> ProconReader<R> { pub fn new(reader: R) -> Self { Self { r: reader, line: String::new(), i: 0, } } pub fn get<T>(&mut self) -> T where T: std::str::FromStr, <T as std::str::FromStr>::Err: std::fmt::Debug, { self.skip_blanks(); assert!(self.i < self.line.len()); assert_ne!(&self.line[self.i..=self.i], " "); let line = &self.line[self.i..]; let end = line.find(' ').unwrap_or_else(|| line.len()); let s = &line[..end]; self.i += end; s.parse() .unwrap_or_else(|_| panic!("parse error `{}`", self.line)) } fn skip_blanks(&mut self) { loop { let start = self.line[self.i..].find(|ch| ch != ' '); match start { Some(j) => { self.i += j; break; } None => { self.line.clear(); self.i = 0; let num_bytes = self.r.read_line(&mut self.line).unwrap(); assert!(num_bytes > 0, "reached EOF :("); self.line = self.line.trim_end_matches(&['\r', '\n'][..]).to_string(); } } } } pub fn get_vec<T>(&mut self, n: usize) -> Vec<T> where T: std::str::FromStr, <T as std::str::FromStr>::Err: std::fmt::Debug, { (0..n).map(|_| self.get()).collect() } }