結果

問題 No.2998 Rainbow Christmas Tree
ユーザー akakimidori
提出日時 2024-12-23 21:57:40
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 67 ms / 3,000 ms
コード長 5,708 bytes
コンパイル時間 13,871 ms
コンパイル使用メモリ 378,288 KB
実行使用メモリ 13,696 KB
最終ジャッジ日時 2024-12-23 21:58:10
合計ジャッジ時間 24,813 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 58
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

fn main() {
    input! {
        n: usize,
        k: usize,
        pa: [[usize1; n]; n - 1],
    }
    let mut dsu = DSU::new(n);
    let mut parent = vec![(n, n); n];
    let mut next = vec![n; n];
    let mut root = n;
    'outer: for (c, p) in pa.iter().enumerate() {
        let r = if c < k { n - 1 } else { 0 };
        for (j, &p) in p.iter().enumerate() {
            if p < n && !dsu.same(p, j) && dsu.same(j, r) {
                dsu.unite(p, j);
                if dsu.same(0, n - 1) {
                    root = p;
                    let mut list = vec![(j, c)];
                    let mut pos = root;
                    while pos != 0 && pos != n - 1 {
                        list.push(parent[pos]);
                        pos = parent[pos].0;
                    }
                    let mut pos = j;
                    while pos != 0 && pos != n - 1 {
                        list.push(parent[pos]);
                        pos = parent[pos].0;
                    }
                    for (j, c) in list {
                        next[j] = c;
                    }
                    break 'outer;
                }
                parent[p] = (j, c);
                break;
            }
        }
    }
    assert!(dsu.same(0, n - 1));
    dsu.init();
    let mut parent = next;
    let mut used = vec![false; n - 1];
    for (i, p) in parent.iter().enumerate() {
        if *p != n {
            dsu.unite(i, pa[*p][i]);
            used[*p] = true;
        }
    }
    assert!(dsu.same(0, n - 1));
    for (i, pa) in pa.iter().enumerate() {
        if used[i] {
            continue;
        }
        for (j, &p) in pa.iter().enumerate() {
            if p < n && j != root && !dsu.same(p, j) && dsu.same(p, 0) {
                parent[j] = i;
                dsu.unite(p, j);
                break;
            }
        }
    }
    assert!(dsu.size(0) == n);
    for p in parent.iter_mut() {
        *p += 1;
    }
    parent[root] = 0;
    println!("Yes");
    use util::*;
    println!("{}", parent.iter().join(" "));
}
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
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_export]
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_export]
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 ----------
//---------- begin union_find ----------
pub struct DSU {
    p: Vec<i32>,
}
impl DSU {
    pub fn new(n: usize) -> DSU {
        assert!(n < std::i32::MAX as usize);
        DSU { p: vec![-1; n] }
    }
    pub fn init(&mut self) {
        self.p.iter_mut().for_each(|p| *p = -1);
    }
    pub fn root(&self, mut x: usize) -> usize {
        assert!(x < self.p.len());
        while self.p[x] >= 0 {
            x = self.p[x] as usize;
        }
        x
    }
    pub fn same(&self, x: usize, y: usize) -> bool {
        assert!(x < self.p.len() && y < self.p.len());
        self.root(x) == self.root(y)
    }
    pub fn unite(&mut self, x: usize, y: usize) -> Option<(usize, usize)> {
        assert!(x < self.p.len() && y < self.p.len());
        let mut x = self.root(x);
        let mut y = self.root(y);
        if x == y {
            return None;
        }
        if self.p[x] > self.p[y] {
            std::mem::swap(&mut x, &mut y);
        }
        self.p[x] += self.p[y];
        self.p[y] = x as i32;
        Some((x, y))
    }
    pub fn parent(&self, x: usize) -> Option<usize> {
        assert!(x < self.p.len());
        let p = self.p[x];
        if p >= 0 {
            Some(p as usize)
        } else {
            None
        }
    }
    pub fn sum<F>(&self, mut x: usize, mut f: F) -> usize
    where
        F: FnMut(usize),
    {
        while let Some(p) = self.parent(x) {
            f(x);
            x = p;
        }
        x
    }
    pub fn size(&self, x: usize) -> usize {
        assert!(x < self.p.len());
        let r = self.root(x);
        (-self.p[r]) as usize
    }
}
//---------- end union_find ----------
mod util {
    pub trait Join {
        fn join(self, sep: &str) -> String;
    }
    impl<T, I> Join for I
    where
        I: Iterator<Item = T>,
        T: std::fmt::Display,
    {
        fn join(self, sep: &str) -> String {
            let mut s = String::new();
            use std::fmt::*;
            for (i, v) in self.enumerate() {
                if i > 0 {
                    write!(&mut s, "{}", sep).ok();
                }
                write!(&mut s, "{}", v).ok();
            }
            s
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0