結果
問題 | No.1647 Travel in Mitaru city 2 |
ユーザー | ikd |
提出日時 | 2021-08-14 17:16:50 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 88 ms / 2,500 ms |
コード長 | 4,488 bytes |
コンパイル時間 | 1,500 ms |
コンパイル使用メモリ | 164,332 KB |
実行使用メモリ | 34,176 KB |
最終ジャッジ日時 | 2024-04-21 05:01:39 |
合計ジャッジ時間 | 7,645 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 0 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 76 ms
31,360 KB |
testcase_09 | AC | 67 ms
28,672 KB |
testcase_10 | AC | 80 ms
31,360 KB |
testcase_11 | AC | 59 ms
25,088 KB |
testcase_12 | AC | 53 ms
24,448 KB |
testcase_13 | AC | 57 ms
25,728 KB |
testcase_14 | AC | 79 ms
32,384 KB |
testcase_15 | AC | 84 ms
31,872 KB |
testcase_16 | AC | 73 ms
30,208 KB |
testcase_17 | AC | 60 ms
25,984 KB |
testcase_18 | AC | 55 ms
25,600 KB |
testcase_19 | AC | 74 ms
32,128 KB |
testcase_20 | AC | 72 ms
29,696 KB |
testcase_21 | AC | 75 ms
32,640 KB |
testcase_22 | AC | 83 ms
32,896 KB |
testcase_23 | AC | 84 ms
33,152 KB |
testcase_24 | AC | 76 ms
30,080 KB |
testcase_25 | AC | 74 ms
31,232 KB |
testcase_26 | AC | 82 ms
33,152 KB |
testcase_27 | AC | 88 ms
33,536 KB |
testcase_28 | AC | 87 ms
34,176 KB |
testcase_29 | AC | 85 ms
34,176 KB |
testcase_30 | AC | 86 ms
32,256 KB |
testcase_31 | AC | 83 ms
34,176 KB |
testcase_32 | AC | 74 ms
33,664 KB |
testcase_33 | AC | 72 ms
30,592 KB |
testcase_34 | AC | 84 ms
34,176 KB |
testcase_35 | AC | 71 ms
31,104 KB |
testcase_36 | AC | 87 ms
34,048 KB |
testcase_37 | AC | 85 ms
34,176 KB |
testcase_38 | AC | 70 ms
28,928 KB |
testcase_39 | AC | 71 ms
26,240 KB |
testcase_40 | AC | 70 ms
28,544 KB |
testcase_41 | AC | 61 ms
26,368 KB |
testcase_42 | AC | 65 ms
28,672 KB |
testcase_43 | AC | 1 ms
5,376 KB |
testcase_44 | AC | 7 ms
9,728 KB |
testcase_45 | AC | 51 ms
22,912 KB |
testcase_46 | AC | 70 ms
22,912 KB |
testcase_47 | AC | 52 ms
22,912 KB |
testcase_48 | AC | 55 ms
22,912 KB |
testcase_49 | AC | 52 ms
22,912 KB |
testcase_50 | AC | 58 ms
22,912 KB |
ソースコード
//! # Bundled libraries //! //! - `procon_reader 0.1.0 (git+https://github.com/ia7ck/rust-competitive-programming#bd4907c0d20d80d0c7a19f92b3bb682e6326d08d)` licensed under **missing** as `crate::__cargo_equip::crates::procon_reader` pub use __cargo_equip::prelude::*; use procon_reader::ProconReader; fn main() { let stdin = std::io::stdin(); let mut rd = ProconReader::new(stdin.lock()); let h: usize = rd.get(); let w: usize = rd.get(); let n: usize = rd.get(); let mut edges = Vec::new(); for _ in 0..n { let x: usize = rd.get(); let y: usize = rd.get(); edges.push((x - 1, h + (y - 1))); } if let Some(mut cycle) = detect_cycle_undirected(h + w, edges.iter().copied()) { assert!(cycle.len() >= 4); let (_, y0) = edges[cycle[0]]; let (_, y1) = edges[cycle[1]]; let (_, y2) = edges[cycle[2]]; if y0 != y1 { assert_eq!(y1, y2); cycle.rotate_left(1); } println!("{}", cycle.len()); for t in cycle { print!("{} ", t + 1); } return; } println!("-1"); } fn detect_cycle_undirected( n: usize, edges: impl Iterator<Item = (usize, usize)>, ) -> Option<Vec<usize>> { fn dfs( curr: usize, prev: usize, g: &Vec<Vec<(usize, usize)>>, seen: &mut Vec<bool>, parent: &mut Vec<(usize, usize)>, ) -> Option<(usize, usize)> { seen[curr] = true; for &(nxt, idx) in &g[curr] { if nxt == prev { continue; } if seen[nxt] { return Some((nxt, curr)); } parent[nxt] = (curr, idx); if let Some((start, end)) = dfs(nxt, curr, g, seen, parent) { return Some((start, end)); } } None } let edges: Vec<(usize, usize)> = edges.collect(); let mut g = vec![vec![]; n]; for (idx, &(u, v)) in edges.iter().enumerate() { g[u].push((v, idx)); g[v].push((u, idx)); } let mut seen = vec![false; n]; let mut parent = vec![(!0, !0); n]; for v in 0..n { if seen[v] { continue; } if let Some((cycle_start, cycle_end)) = dfs(v, !0, &g, &mut seen, &mut parent) { let mut cycle = Vec::new(); { let mut curr = cycle_end; while curr != cycle_start { let (par, idx) = parent[curr]; cycle.push(idx); curr = par; } } // cycle_end <- parent[cycle_end] <- parent[parent[cycle_end]] <- ... <- cycle_start for (idx, &(u, v)) in edges.iter().enumerate() { if (u, v) == (cycle_start, cycle_end) || (u, v) == (cycle_end, cycle_start) { cycle.push(idx); return Some(cycle); } } unreachable!(); } } None } // The following code was expanded by `cargo-equip`. #[rustfmt::skip] #[allow(unused)] mod __cargo_equip { pub(crate) mod crates { pub mod procon_reader {use std::io::BufRead;use std::str::FromStr;pub struct ProconReader<R>{r:R,l:String,i:usize,}impl<R:BufRead>ProconReader<R>{pub fn new(reader:R)->Self{Self{r:reader,l:String::new(),i:0,}}pub fn get<T>(&mut self)->T where T:FromStr,<T as FromStr>::Err:std::fmt::Debug,{self.skip_blanks();assert!(self.i<self.l.len());assert_ne!(&self.l[self.i..=self.i]," ");let rest=&self.l[self.i..];let len=rest.find(' ').unwrap_or_else(| |rest.len());let val=rest[..len].parse().unwrap_or_else(|e|panic!("{:?}, attempt to read `{}`",e,rest));self.i+=len;val}fn skip_blanks(&mut self){loop{match self.l[self.i..].find(|ch|ch!=' '){Some(j)=>{self.i+=j;break;}None=>{let mut buf=String::new();let num_bytes=self.r.read_line(&mut buf).unwrap_or_else(|_|panic!("invalid UTF-8"));assert!(num_bytes>0,"reached EOF :(");self.l=buf.trim_end_matches('\n').trim_end_matches('\r').to_string();self.i=0;}}}}pub fn get_vec<T>(&mut self,n:usize)->Vec<T>where T:FromStr,<T as FromStr>::Err:std::fmt::Debug,{(0..n).map(|_|self.get()).collect()}pub fn get_chars(&mut self)->Vec<char>{self.get::<String>().chars().collect()}}} } pub(crate) mod macros { pub mod procon_reader {} } pub(crate) mod prelude {pub use crate::__cargo_equip::crates::*;} mod preludes { pub mod procon_reader {} } }