結果

問題 No.1640 簡単な色塗り
ユーザー koba-e964koba-e964
提出日時 2021-08-06 23:08:41
言語 Rust
(1.77.0)
結果
AC  
実行時間 1,281 ms / 2,000 ms
コード長 4,612 bytes
コンパイル時間 5,151 ms
コンパイル使用メモリ 173,144 KB
実行使用メモリ 41,152 KB
最終ジャッジ日時 2023-09-12 03:12:27
合計ジャッジ時間 32,882 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,384 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 801 ms
30,736 KB
testcase_05 AC 1,281 ms
41,152 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 562 ms
18,936 KB
testcase_11 AC 457 ms
15,636 KB
testcase_12 AC 395 ms
14,100 KB
testcase_13 AC 887 ms
28,184 KB
testcase_14 AC 897 ms
28,088 KB
testcase_15 AC 287 ms
10,628 KB
testcase_16 AC 347 ms
12,480 KB
testcase_17 AC 716 ms
23,680 KB
testcase_18 AC 59 ms
4,380 KB
testcase_19 AC 405 ms
13,744 KB
testcase_20 AC 551 ms
18,460 KB
testcase_21 AC 440 ms
15,164 KB
testcase_22 AC 41 ms
4,380 KB
testcase_23 AC 595 ms
19,748 KB
testcase_24 AC 155 ms
6,308 KB
testcase_25 AC 413 ms
14,252 KB
testcase_26 AC 655 ms
21,488 KB
testcase_27 AC 273 ms
10,100 KB
testcase_28 AC 846 ms
27,004 KB
testcase_29 AC 638 ms
21,324 KB
testcase_30 AC 16 ms
5,004 KB
testcase_31 AC 156 ms
27,712 KB
testcase_32 AC 131 ms
24,388 KB
testcase_33 AC 81 ms
16,924 KB
testcase_34 AC 107 ms
20,780 KB
testcase_35 AC 82 ms
16,896 KB
testcase_36 AC 16 ms
5,096 KB
testcase_37 AC 22 ms
6,728 KB
testcase_38 AC 140 ms
25,292 KB
testcase_39 AC 50 ms
11,592 KB
testcase_40 AC 51 ms
11,824 KB
testcase_41 AC 116 ms
21,452 KB
testcase_42 AC 60 ms
13,284 KB
testcase_43 AC 64 ms
13,724 KB
testcase_44 AC 61 ms
13,376 KB
testcase_45 AC 44 ms
10,392 KB
testcase_46 AC 19 ms
5,664 KB
testcase_47 AC 12 ms
4,380 KB
testcase_48 AC 147 ms
25,812 KB
testcase_49 AC 6 ms
4,376 KB
testcase_50 AC 1 ms
4,380 KB
testcase_51 AC 1 ms
4,380 KB
testcase_52 AC 987 ms
34,272 KB
testcase_53 AC 979 ms
35,072 KB
07_evil_01.txt TLE -
07_evil_02.txt TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

/**
 * 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]
    }
}

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();
}

// Given a cycle, finds one of its hamiltonian paths.
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);
    }
}

// Tags: namori-graph, namori-forest, sat-on-graphs
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);
    }
}
0