結果

問題 No.1153 ねこちゃんゲーム
ユーザー koba-e964koba-e964
提出日時 2021-10-11 11:42:21
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 2,369 ms / 2,500 ms
コード長 5,367 bytes
コンパイル時間 16,914 ms
コンパイル使用メモリ 384,476 KB
実行使用メモリ 83,840 KB
最終ジャッジ日時 2024-09-15 09:25:32
合計ジャッジ時間 109,489 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 12 ms
5,376 KB
testcase_03 AC 12 ms
5,376 KB
testcase_04 AC 12 ms
5,376 KB
testcase_05 AC 12 ms
5,376 KB
testcase_06 AC 12 ms
5,376 KB
testcase_07 AC 2,261 ms
48,000 KB
testcase_08 AC 2,271 ms
47,932 KB
testcase_09 AC 2,369 ms
48,000 KB
testcase_10 AC 2,265 ms
47,872 KB
testcase_11 AC 2,234 ms
48,096 KB
testcase_12 AC 2,262 ms
48,016 KB
testcase_13 AC 2,246 ms
48,000 KB
testcase_14 AC 2,255 ms
48,128 KB
testcase_15 AC 2,225 ms
47,872 KB
testcase_16 AC 2,262 ms
48,000 KB
testcase_17 AC 2,242 ms
48,256 KB
testcase_18 AC 2,259 ms
48,128 KB
testcase_19 AC 2,225 ms
48,316 KB
testcase_20 AC 2,219 ms
48,384 KB
testcase_21 AC 2,255 ms
48,640 KB
testcase_22 AC 2,234 ms
48,128 KB
testcase_23 AC 2,249 ms
48,128 KB
testcase_24 AC 2,277 ms
48,356 KB
testcase_25 AC 2,284 ms
48,372 KB
testcase_26 AC 2,255 ms
48,452 KB
testcase_27 AC 2,289 ms
83,308 KB
testcase_28 AC 2,296 ms
83,840 KB
testcase_29 AC 2,326 ms
80,640 KB
testcase_30 AC 2,317 ms
80,048 KB
testcase_31 AC 2,255 ms
67,200 KB
testcase_32 AC 2,214 ms
50,432 KB
testcase_33 AC 2,186 ms
50,184 KB
testcase_34 AC 2,207 ms
50,404 KB
testcase_35 AC 2,170 ms
50,276 KB
testcase_36 AC 2,225 ms
50,432 KB
testcase_37 AC 2,025 ms
50,560 KB
testcase_38 AC 2,041 ms
50,304 KB
testcase_39 AC 2,039 ms
50,560 KB
testcase_40 AC 2,028 ms
50,432 KB
testcase_41 AC 2,033 ms
50,304 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
// 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; } }
}

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

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

impl MexLeaveOne {
    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
    }
}

fn dfs1(
    v: usize, par: usize, g: &[Vec<usize>],
    dp_loo: &mut [MexLeaveOne], dp2: &mut [Vec<usize>],
) {
    let mut seen = HashSet::new();
    let mut mydp2 = vec![0; g[v].len()];
    for i in 0..g[v].len() {
        let w = g[v][i];
        if w == par { continue; }
        dfs1(w, v, g, dp_loo, dp2);
        mydp2[i] = dp_loo[w].as_is();
        seen.insert(mydp2[i]);
    }
    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 i in 0..g[v].len() {
        let w = g[v][i];
        if w == par { continue; }
        if mydp2[i] < mex2 {
            f[mydp2[i]] += 1;
        }
    }
    let loo = MexLeaveOne {
        mex1: mex1,
        mex2: mex2,
        f: f,
    };
    dp_loo[v] = loo;
    dp2[v] = mydp2;
}
fn dfs2(
    v: usize, par: usize, g: &[Vec<usize>],
    dp1: &mut [usize],
    dp_loo: &[MexLeaveOne],
    dp2: &mut [Vec<usize>],
    passed: usize,
) {
    for i in 0..g[v].len() {
        let w = g[v][i];
        if w == par {
            dp2[v][i] = passed;
            continue;
        }
        let inherited = if par >= g.len() {
            dp_loo[v].leave_one(dp2[v][i])
        } else {
            dp_loo[v].exchange_one(dp2[v][i], passed)
        };
        dfs2(w, v, g, dp1, dp_loo, dp2, inherited);
    }
    dp1[v] = if par >= g.len() {
        dp_loo[v].as_is()
    } else {
        dp_loo[v].add_one(passed)
    };
}

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 mut dp1 = vec![0; n];
    let mut dp2 = vec![vec![]; n];
    let mut dp_loo = vec![MexLeaveOne::default(); n];
    dfs1(0, n, &g, &mut dp_loo, &mut dp2);
    dfs2(0, n, &g, &mut dp1, &dp_loo, &mut dp2, 0);
    let mut gr = 0;
    for &a in &a {
        gr ^= dp1[a];
    }
    eprintln!("gr = {}", gr);
    eprintln!("dp1 = {:?}", dp1);
    eprintln!("dp2 = {:?}", dp2);
    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 ^ dp1[i] ^ dp2[i][j]) == 0 {
                let idx = a.iter().position(|&a| a == i).unwrap();
                println!("{} {}", idx + 1, g[i][j] + 1);
                return;
            }
        }
    }
}
0