結果

問題 No.1153 ねこちゃんゲーム
ユーザー koba-e964koba-e964
提出日時 2021-10-11 22:24:35
言語 Rust
(1.77.0)
結果
AC  
実行時間 407 ms / 2,500 ms
コード長 6,178 bytes
コンパイル時間 2,345 ms
コンパイル使用メモリ 170,740 KB
実行使用メモリ 94,264 KB
最終ジャッジ日時 2023-10-14 08:46:25
合計ジャッジ時間 26,127 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,348 KB
testcase_01 AC 2 ms
4,352 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 2 ms
4,348 KB
testcase_04 AC 2 ms
4,352 KB
testcase_05 AC 2 ms
4,356 KB
testcase_06 AC 2 ms
4,352 KB
testcase_07 AC 300 ms
47,192 KB
testcase_08 AC 300 ms
47,152 KB
testcase_09 AC 324 ms
47,108 KB
testcase_10 AC 332 ms
47,108 KB
testcase_11 AC 314 ms
47,124 KB
testcase_12 AC 323 ms
47,156 KB
testcase_13 AC 318 ms
47,108 KB
testcase_14 AC 327 ms
47,096 KB
testcase_15 AC 317 ms
47,104 KB
testcase_16 AC 318 ms
47,160 KB
testcase_17 AC 320 ms
47,364 KB
testcase_18 AC 312 ms
47,240 KB
testcase_19 AC 318 ms
47,484 KB
testcase_20 AC 329 ms
47,684 KB
testcase_21 AC 313 ms
47,644 KB
testcase_22 AC 324 ms
47,420 KB
testcase_23 AC 315 ms
47,116 KB
testcase_24 AC 326 ms
47,372 KB
testcase_25 AC 335 ms
47,356 KB
testcase_26 AC 311 ms
47,644 KB
testcase_27 AC 368 ms
93,448 KB
testcase_28 AC 370 ms
94,264 KB
testcase_29 AC 373 ms
90,100 KB
testcase_30 AC 365 ms
89,840 KB
testcase_31 AC 407 ms
72,492 KB
testcase_32 AC 282 ms
49,628 KB
testcase_33 AC 286 ms
49,508 KB
testcase_34 AC 289 ms
49,640 KB
testcase_35 AC 284 ms
49,556 KB
testcase_36 AC 290 ms
49,720 KB
testcase_37 AC 171 ms
50,436 KB
testcase_38 AC 139 ms
50,440 KB
testcase_39 AC 154 ms
50,488 KB
testcase_40 AC 166 ms
49,688 KB
testcase_41 AC 136 ms
49,680 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// 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"));
}

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

// Verified by: https://atcoder.jp/contests/abc160/submissions/26509495
trait LeaveOne<App = ()>: Default + Clone {
    type T: Default + Clone;
    type App;
    fn build(vals: &[Self::T], app: &Self::App) -> Self;
    fn leave_one(&self, excl: Self::T) -> Self::T;
    fn exchange_one(&self, excl: Self::T, incl: Self::T) -> Self::T;
    fn add_one(&self, incl: Self::T) -> Self::T;
    fn as_is(&self) -> Self::T;
}

struct Reroot<LOO: LeaveOne> {
    #[allow(unused)]
    pub dp1: Vec<LOO::T>,
    #[allow(unused)]
    pub dp2: Vec<Vec<LOO::T>>,
    #[allow(unused)]
    pub dp_loo: Vec<LOO>,
}

impl<LOO: LeaveOne> Reroot<LOO> {
    pub fn new(g: &[Vec<usize>], app: &LOO::App) -> Self {
        let n = g.len();
        let mut dp1 = vec![LOO::T::default(); n];
        let mut dp2 = vec![vec![]; n];
        let mut dp_loo = vec![LOO::default(); n];
        Self::dfs1(0, n, &g, &mut dp_loo, &mut dp2, app);
        Self::dfs2(0, n, &g, &mut dp1, &dp_loo, &mut dp2, &app, LOO::T::default());
        Reroot {
            dp1: dp1,
            dp2: dp2,
            dp_loo: dp_loo,
        }
    }
    fn dfs1(
        v: usize, par: usize, g: &[Vec<usize>],
        dp_loo: &mut [LOO], dp2: &mut [Vec<LOO::T>], app: &LOO::App,
    ) {
        let mut mydp2 = vec![LOO::T::default(); g[v].len()];
        let mut chval = vec![];
        for i in 0..g[v].len() {
            let w = g[v][i];
            if w == par { continue; }
            Self::dfs1(w, v, g, dp_loo, dp2, app);
            mydp2[i] = dp_loo[w].as_is();
            chval.push(mydp2[i].clone());
        }
        dp_loo[v] = LOO::build(&chval, app);
        dp2[v] = mydp2;
    }
    fn dfs2(
        v: usize, par: usize, g: &[Vec<usize>],
        dp1: &mut [LOO::T],
        dp_loo: &[LOO],
        dp2: &mut [Vec<LOO::T>],
        app: &LOO::App,
        passed: LOO::T,
    ) {
        for i in 0..g[v].len() {
            let w = g[v][i];
            if w == par {
                dp2[v][i] = passed.clone();
                continue;
            }
            let inherited = if par >= g.len() {
                dp_loo[v].leave_one(dp2[v][i].clone())
            } else {
                dp_loo[v].exchange_one(dp2[v][i].clone(), passed.clone())
            };
            Self::dfs2(w, v, g, dp1, dp_loo, dp2, app, inherited);
        }
        dp1[v] = if par >= g.len() {
            dp_loo[v].as_is()
        } else {
            dp_loo[v].add_one(passed)
        };
    }
}

#[derive(Default, Clone, Debug)]
struct MexLeaveOne {
    mex1: usize,
    mex2: usize,
    f: Vec<usize>,
}

impl LeaveOne for MexLeaveOne {
    type T = usize;
    type App = ();
    fn build(vals: &[usize], _: &()) -> Self {
        let seen = vals.iter().cloned().collect::<std::collections::HashSet<_>>();
        let mut mex1 = 0;
        while seen.contains(&mex1) {
            mex1 += 1;
        }
        let mut mex2 = mex1 + 1;
        while seen.contains(&mex2) {
            mex2 += 1;
        }
        let mut f = vec![0; mex2];
        for &v in vals {
            if v < mex2 {
                f[v] += 1;
            }
        }
        let loo = MexLeaveOne {
            mex1: mex1,
            mex2: mex2,
            f: f,
        };
        loo
    }
    fn leave_one(&self, excl: usize) -> usize {
        if excl >= self.mex1 {
            return self.mex1;
        }
        if self.f[excl] == 1 {
            return excl;
        }
        self.mex1
    }
    fn exchange_one(&self, excl: usize, incl: usize) -> usize {
        if excl == incl {
            return self.mex1;
        }
        let mex = self.add_one(incl);
        if excl >= mex {
            return mex;
        }
        let res = if self.f[excl] == 1 {
            excl
        } else {
            mex
        };
        res
    }
    fn add_one(&self, incl: usize) -> usize {
        if incl == self.mex1 {
            self.mex2
        } else {
            self.mex1
        }
    }
    fn as_is(&self) -> usize {
        self.mex1
    }
}

// Tags: rerooting
fn solve() {
    input! {
        n: usize, m: usize,
        a: [usize1; m],
        uv: [(usize1, usize1); n - 1],
    }
    let mut g = vec![vec![]; n];
    for &(u, v) in &uv {
        g[u].push(v);
        g[v].push(u);
    }
    let reroot = Reroot::<MexLeaveOne>::new(&g, &());
    let mut gr = 0;
    for &a in &a {
        gr ^= reroot.dp1[a];
    }
    if gr == 0 {
        println!("-1 -1");
        return;
    }
    let mut pop = vec![false; n];
    for &a in &a {
        pop[a] = true;
    }
    for i in 0..n {
        if !pop[i] { continue; }
        for j in 0..g[i].len() {
            if (gr ^ reroot.dp1[i] ^ reroot.dp2[i][j]) == 0 {
                let idx = a.iter().position(|&a| a == i).unwrap();
                println!("{} {}", idx + 1, g[i][j] + 1);
                return;
            }
        }
    }
}
0