結果
問題 | No.1640 簡単な色塗り |
ユーザー | koba-e964 |
提出日時 | 2021-08-06 23:02:27 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 1,297 ms / 2,000 ms |
コード長 | 8,201 bytes |
コンパイル時間 | 3,560 ms |
コンパイル使用メモリ | 178,140 KB |
実行使用メモリ | 42,516 KB |
最終ジャッジ日時 | 2023-09-12 03:08:49 |
合計ジャッジ時間 | 33,452 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,384 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 807 ms
30,812 KB |
testcase_05 | AC | 1,297 ms
42,516 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,384 KB |
testcase_10 | AC | 573 ms
18,936 KB |
testcase_11 | AC | 464 ms
15,652 KB |
testcase_12 | AC | 403 ms
14,168 KB |
testcase_13 | AC | 934 ms
28,176 KB |
testcase_14 | AC | 903 ms
28,120 KB |
testcase_15 | AC | 289 ms
10,556 KB |
testcase_16 | AC | 364 ms
12,536 KB |
testcase_17 | AC | 742 ms
23,672 KB |
testcase_18 | AC | 62 ms
4,380 KB |
testcase_19 | AC | 416 ms
13,856 KB |
testcase_20 | AC | 568 ms
18,432 KB |
testcase_21 | AC | 446 ms
15,160 KB |
testcase_22 | AC | 42 ms
4,376 KB |
testcase_23 | AC | 596 ms
19,732 KB |
testcase_24 | AC | 158 ms
6,396 KB |
testcase_25 | AC | 418 ms
14,312 KB |
testcase_26 | AC | 681 ms
21,568 KB |
testcase_27 | AC | 286 ms
10,108 KB |
testcase_28 | AC | 867 ms
27,076 KB |
testcase_29 | AC | 662 ms
21,356 KB |
testcase_30 | AC | 18 ms
5,080 KB |
testcase_31 | AC | 164 ms
27,696 KB |
testcase_32 | AC | 136 ms
24,344 KB |
testcase_33 | AC | 91 ms
16,924 KB |
testcase_34 | AC | 115 ms
20,776 KB |
testcase_35 | AC | 84 ms
16,944 KB |
testcase_36 | AC | 18 ms
5,012 KB |
testcase_37 | AC | 25 ms
6,648 KB |
testcase_38 | AC | 150 ms
25,336 KB |
testcase_39 | AC | 52 ms
11,556 KB |
testcase_40 | AC | 52 ms
11,784 KB |
testcase_41 | AC | 121 ms
21,340 KB |
testcase_42 | AC | 65 ms
13,308 KB |
testcase_43 | AC | 64 ms
13,720 KB |
testcase_44 | AC | 62 ms
13,432 KB |
testcase_45 | AC | 44 ms
10,428 KB |
testcase_46 | AC | 19 ms
5,648 KB |
testcase_47 | AC | 12 ms
4,380 KB |
testcase_48 | AC | 148 ms
25,812 KB |
testcase_49 | AC | 5 ms
4,380 KB |
testcase_50 | AC | 1 ms
4,380 KB |
testcase_51 | AC | 1 ms
4,380 KB |
testcase_52 | AC | 1,003 ms
34,832 KB |
testcase_53 | AC | 996 ms
35,004 KB |
07_evil_01.txt | TLE | - |
07_evil_02.txt | TLE | - |
コンパイルメッセージ
warning: struct `NamoriSplit` is never constructed --> Main.rs:92:8 | 92 | struct NamoriSplit<T> { | ^^^^^^^^^^^ | = note: `#[warn(dead_code)]` on by default warning: function `namori_split` is never used --> Main.rs:107:4 | 107 | fn namori_split<T: Clone>(g: &[Vec<(usize, T)>]) -> NamoriSplit<T> { | ^^^^^^^^^^^^ warning: 2 warnings emitted
ソースコード
#[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; } } } /** * Union-Find tree. * Verified by https://atcoder.jp/contests/pakencamp-2019-day3/submissions/9253305 */ struct UnionFind { disj: Vec<usize>, rank: Vec<usize> } impl UnionFind { fn new(n: usize) -> Self { let disj = (0..n).collect(); UnionFind { disj: disj, rank: vec![1; n] } } fn root(&mut self, x: usize) -> usize { if x != self.disj[x] { let par = self.disj[x]; let r = self.root(par); self.disj[x] = r; } self.disj[x] } fn unite(&mut self, x: usize, y: usize) { let mut x = self.root(x); let mut y = self.root(y); if x == y { return } if self.rank[x] > self.rank[y] { std::mem::swap(&mut x, &mut y); } self.disj[x] = y; self.rank[y] += self.rank[x]; } #[allow(unused)] fn is_same_set(&mut self, x: usize, y: usize) -> bool { self.root(x) == self.root(y) } #[allow(unused)] fn size(&mut self, x: usize) -> usize { let x = self.root(x); self.rank[x] } } struct NamoriSplit<T> { #[allow(unused)] forest: Vec<Vec<(usize, T)>>, #[allow(unused)] forest_e: Vec<Vec<usize>>, #[allow(unused)] to_root: Vec<usize>, #[allow(unused)] roots: Vec<usize>, #[allow(unused)] cycle: Vec<T>, #[allow(unused)] to_id: Vec<usize>, } fn namori_split<T: Clone>(g: &[Vec<(usize, T)>]) -> NamoriSplit<T> { fn dfs1(v: usize, par: usize, g: &[Vec<usize>], r: usize, root: &mut [usize]) { root[v] = r; for &w in &g[v] { if w == par { continue; } dfs1(w, v, g, r, root); } } fn get_root_seq<T: Clone>(roots: &[usize], cyc: &[Vec<(usize, T)>]) -> Vec<(usize, T)> { let mut root_seq = vec![]; let v = roots[0]; if roots.len() == 2 { for i in 0..2 { root_seq.push((roots[i], cyc[v][i].1.clone())); } return root_seq; } let (mut w, c) = cyc[v][0].clone(); root_seq.push((v, c)); while w != v { let mut nxt = None; for &(a, ref b) in &cyc[w] { if a == root_seq[root_seq.len() - 1].0 { continue; } nxt = Some((a, b.clone())); break; } let nxt = nxt.unwrap(); root_seq.push((w, nxt.1)); w = nxt.0; } root_seq } let n = g.len(); let mut deg = vec![0; n]; for i in 0..n { deg[i] = g[i].len(); } let mut que = vec![]; for i in 0..n { if deg[i] == 1 { que.push(i); } } let mut rem = vec![true; n]; while let Some(v) = que.pop() { if !rem[v] { continue; } rem[v] = false; for &(w, _) in &g[v] { if rem[w] { deg[w] -= 1; if deg[w] == 1 { que.push(w); } } } } let mut forest = vec![vec![]; n]; let mut forest_e = vec![vec![]; n]; let mut cyc = vec![vec![]; n]; let mut roots = vec![]; for i in 0..n { if rem[i] { roots.push(i); } for &(a, ref c) in &g[i] { if rem[i] && rem[a] { cyc[i].push((a, c.clone())); } else { forest[i].push((a, c.clone())); forest_e[i].push(a); } } } let mut to_root = vec![0; n]; for &r in &roots { dfs1(r, n, &forest_e, r, &mut to_root); } let root_seq; let mut to_id = vec![n; n]; let mut roots_0 = vec![]; let mut cycle = vec![]; { root_seq = get_root_seq(&roots, &cyc); for i in 0..root_seq.len() { to_id[root_seq[i].0] = i; roots_0.push(root_seq[i].0); cycle.push(root_seq[i].1.clone()); } } for i in 0..n { to_id[i] = to_id[to_root[i]]; } NamoriSplit { forest: forest, forest_e: forest_e, to_root: to_root, roots: roots_0, cycle: cycle, to_id: to_id, } } 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 dfs(v: usize, par: usize, eidx: usize, g: &[HashMap<usize, usize>], vis: &mut [bool], einfo: &mut [usize]) { let n = g.len(); if par < n && einfo[eidx] >= n { einfo[eidx] = par; } if vis[v] { return; } vis[v] = true; for (&widx, &w) in &g[v] { if widx == eidx { continue; } dfs(w, v, widx, g, vis, einfo); } } 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, ab: [(usize1, usize1); n], } let mut g = vec![vec![]; n]; let mut gr = vec![HashMap::new(); n]; let mut uf = UnionFind::new(n); for i in 0..n { let (a, b) = ab[i]; g[a].push((b, i)); g[b].push((a, i)); gr[a].insert(i, b); gr[b].insert(i, a); uf.unite(a, b); } let mut es = vec![0; n]; for i in 0..n { let (a, _) = ab[i]; es[uf.root(a)] += 1; } for i in 0..n { if uf.root(i) == i && uf.size(i) != es[i] { puts!("No\n"); return; } } puts!("Yes\n"); let mut deg = vec![0; n]; for i in 0..n { deg[i] = g[i].len(); } let mut que = vec![]; for i in 0..n { if deg[i] == 1 { let (&idx, &to) = gr[i].iter().next().unwrap(); que.push((i, idx, to)); } } let mut einfo = vec![1 << 20; n]; while let Some((v, idx, w)) = que.pop() { einfo[idx] = v; deg[v] -= 1; gr[w].remove(&idx); deg[w] -= 1; if deg[w] == 1 { let (&idx, &to) = gr[w].iter().next().unwrap(); que.push((w, idx, to)); } } eprintln!("gr = {:?}", gr); let mut vis = vec![false; n]; for i in 0..n { if !vis[i] { dfs(i, n, n, &gr, &mut vis, &mut einfo); } } for i in 0..n { puts!("{}\n", einfo[i] + 1); } }