結果

問題 No.2998 Rainbow Christmas Tree
ユーザー akakimidoriakakimidori
提出日時 2024-12-23 21:37:09
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 5,661 bytes
コンパイル時間 15,544 ms
コンパイル使用メモリ 379,480 KB
実行使用メモリ 13,696 KB
最終ジャッジ日時 2024-12-23 21:37:48
合計ジャッジ時間 32,652 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 WA -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 WA -
testcase_19 RE -
testcase_20 RE -
testcase_21 WA -
testcase_22 RE -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 WA -
testcase_39 RE -
testcase_40 RE -
testcase_41 WA -
testcase_42 RE -
testcase_43 WA -
testcase_44 RE -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 RE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: value assigned to `root` is never read
 --> src/main.rs:9:13
  |
9 |     let mut root = n;
  |             ^^^^
  |
  = help: maybe it is overwritten before being read?
  = note: `#[warn(unused_assignments)]` on by default

ソースコード

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];
    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);
                parent[j] = c;
                if dsu.same(0, n - 1) {
                    root = p;
                    let mut fix = vec![false; n];
                    fix[root] = true;
                    parent[root] = n;
                    for &x in [0, n - 1].iter() {
                        let mut pos = x;
                        while pos != root {
                            fix[pos] = true;
                            pos = pa[parent[pos]][pos];
                        }
                    }
                    for i in 0..n {
                        if !fix[i] {
                            parent[i] = n;
                        }
                    }
                    break 'outer;
                }
            }
        }
    }
    assert!(dsu.same(0, n - 1));
    dsu.init();
    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 && parent[j] == n && !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
        }
    }
}
0