結果
問題 | No.1865 Make Cycle |
ユーザー | akakimidori |
提出日時 | 2022-03-04 21:48:06 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 139 ms / 3,000 ms |
コード長 | 5,147 bytes |
コンパイル時間 | 942 ms |
コンパイル使用メモリ | 159,632 KB |
実行使用メモリ | 11,192 KB |
最終ジャッジ日時 | 2023-09-26 00:36:16 |
合計ジャッジ時間 | 4,043 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 80 ms
8,152 KB |
testcase_01 | AC | 51 ms
6,624 KB |
testcase_02 | AC | 132 ms
8,072 KB |
testcase_03 | AC | 38 ms
7,148 KB |
testcase_04 | AC | 69 ms
8,096 KB |
testcase_05 | AC | 14 ms
7,652 KB |
testcase_06 | AC | 82 ms
8,004 KB |
testcase_07 | AC | 75 ms
7,524 KB |
testcase_08 | AC | 106 ms
10,116 KB |
testcase_09 | AC | 13 ms
7,628 KB |
testcase_10 | AC | 96 ms
8,472 KB |
testcase_11 | AC | 89 ms
8,140 KB |
testcase_12 | AC | 76 ms
7,364 KB |
testcase_13 | AC | 84 ms
9,400 KB |
testcase_14 | AC | 61 ms
6,720 KB |
testcase_15 | AC | 116 ms
8,628 KB |
testcase_16 | AC | 114 ms
9,088 KB |
testcase_17 | AC | 13 ms
6,568 KB |
testcase_18 | AC | 13 ms
7,892 KB |
testcase_19 | AC | 139 ms
11,192 KB |
testcase_20 | AC | 1 ms
4,376 KB |
testcase_21 | AC | 1 ms
4,376 KB |
testcase_22 | AC | 1 ms
4,380 KB |
testcase_23 | AC | 1 ms
4,376 KB |
コンパイルメッセージ
warning: unused import: `std::io::Write` --> Main.rs:146:5 | 146 | use std::io::Write; | ^^^^^^^^^^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: type alias `Map` is never used --> Main.rs:149:6 | 149 | type Map<K, V> = BTreeMap<K, V>; | ^^^ | = note: `#[warn(dead_code)]` on by default warning: type alias `Set` is never used --> Main.rs:150:6 | 150 | type Set<T> = BTreeSet<T>; | ^^^ warning: type alias `Deque` is never used --> Main.rs:151:6 | 151 | type Deque<T> = VecDeque<T>; | ^^^^^ warning: 4 warnings emitted
ソースコード
// ---------- begin SCC ---------- pub struct SCC { size: usize, edge: Vec<(u32, u32)>, } impl SCC { pub fn new(size: usize) -> Self { assert!(size <= 10usize.pow(8)); SCC { size, edge: vec![] } } pub fn add_edge(&mut self, a: usize, b: usize) { assert!(a < self.size && b < self.size); self.edge.push((a as u32, b as u32)); } pub fn build(&self) -> (usize, Vec<usize>) { let size = self.size; let mut start = vec![0u32; size + 1]; self.edge.iter().for_each(|e| start[e.0 as usize + 1] += 1); for i in 1..=size { start[i] += start[i - 1]; } let mut buf = vec![0u32; self.edge.len()]; for &(a, b) in self.edge.iter() { let po = &mut start[a as usize]; buf[*po as usize] = b; *po += 1; } let mut s = 0usize; let neighbor = start[..size].iter().map(|t| { let t = *t as usize; let it = buf[s..t].iter().map(|p| *p as usize); s = t; it }).collect::<Vec<_>>(); struct Graph<I> { neighbor: Vec<I>, ord: Vec<usize>, assigned: Vec<bool>, stack_s: Vec<usize>, stack_p: Vec<usize>, cnt: usize, id: usize, res: Vec<usize>, } impl<I: Iterator<Item = usize>> Graph<I> { fn dfs(&mut self, v: usize) { self.ord[v] = self.cnt; self.cnt += 1; self.stack_s.push(v); self.stack_p.push(v); while let Some(u) = self.neighbor[v].next() { if self.ord[u] == !0 { self.dfs(u); } else if !self.assigned[u] { while self.ord[*self.stack_p.last().unwrap()] > self.ord[u] { self.stack_p.pop(); } } } if *self.stack_p.last().unwrap() == v { while let Some(u) = self.stack_s.pop() { self.res[u] = self.id; self.assigned[u] = true; if u == v { break; } } self.stack_p.pop(); self.id += 1; } } } let mut g = Graph { neighbor: neighbor, ord: vec![!0; size], assigned: vec![false; size], stack_s: vec![], stack_p: vec![], id: 0, cnt: 0, res: vec![0; size], }; for i in 0..size { if g.ord[i] == !0 { g.dfs(i); } } let Graph { mut res, id, .. } = g; res.iter_mut().for_each(|v| *v = id - 1 - *v); (id, res) } } // ---------- end SCC ---------- // ---------- 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, q: usize, e: [(usize1, usize1); q], } let valid = |m: usize| -> bool { let mut scc = SCC::new(n); for &(a, b) in e.iter().take(m) { scc.add_edge(a, b); } scc.build().0 < n }; if !valid(q) { println!("-1"); return; } let mut ng = 0; let mut ok = q; while ok - ng > 1 { let mid = (ok + ng) / 2; if valid(mid) { ok = mid; } else { ng = mid; } } println!("{}", ok); } fn main() { run(); }