結果

問題 No.2892 Lime and Karin
ユーザー koba-e964koba-e964
提出日時 2024-10-22 18:22:15
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 6,145 bytes
コンパイル時間 13,028 ms
コンパイル使用メモリ 406,444 KB
実行使用メモリ 31,424 KB
最終ジャッジ日時 2024-10-22 18:22:39
合計ジャッジ時間 22,840 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,820 KB
testcase_02 AC 1 ms
6,816 KB
testcase_03 AC 1 ms
6,820 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 1 ms
6,816 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
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 AC 43 ms
16,224 KB
testcase_35 AC 43 ms
16,352 KB
testcase_36 AC 44 ms
16,228 KB
testcase_37 AC 43 ms
16,204 KB
testcase_38 AC 43 ms
16,348 KB
testcase_39 AC 313 ms
24,728 KB
testcase_40 AC 310 ms
29,108 KB
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 AC 83 ms
7,604 KB
testcase_45 AC 236 ms
14,720 KB
testcase_46 AC 104 ms
8,580 KB
testcase_47 AC 133 ms
10,628 KB
testcase_48 AC 49 ms
6,816 KB
testcase_49 AC 159 ms
12,032 KB
testcase_50 AC 140 ms
16,512 KB
testcase_51 AC 149 ms
16,400 KB
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
権限があれば一括ダウンロードができます

ソースコード

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

trait Bisect<T> {
    fn lower_bound(&self, val: &T) -> usize;
    fn upper_bound(&self, val: &T) -> usize;
}

impl<T: Ord> Bisect<T> for [T] {
    fn lower_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] >= val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
    fn upper_bound(&self, val: &T) -> usize {
        let mut pass = self.len() + 1;
        let mut fail = 0;
        while pass - fail > 1 {
            let mid = (pass + fail) / 2;
            if &self[mid - 1] > val {
                pass = mid;
            } else {
                fail = mid;
            }
        }
        pass - 1
    }
}

// Returns (root, children)
// This functions uses O(n) stack space.
// Complexity: O(n log n)-time, O(n)-space
// Verified by: ABC291-Ex (https://atcoder.jp/contests/abc291/submissions/39303290)
fn centroid_decompose(g: &[Vec<usize>]) -> (usize, Vec<Vec<usize>>) {
    fn find_subtree_sizes(g: &[Vec<usize>], v: usize, par: usize,
                          dp: &mut [usize], vis: &[bool]) {
        let mut sum = 1;
        for &w in &g[v] {
            if par == w || vis[w] { continue; }
            find_subtree_sizes(g, w, v, dp, vis);
            sum += dp[w];
        }
        dp[v] = sum;
    }
    fn centroid_decompose_inner(g: &[Vec<usize>], v: usize, par: usize,
                                ch: &mut [Vec<usize>],
                                dp: &mut [usize], vis: &mut [bool]) -> usize {
        let n = g.len();
        find_subtree_sizes(g, v, n, dp, vis);
        let cent = {
            let sz = dp[v];
            let find_centroid = |mut v: usize, mut par: usize| {
                loop {
                    let mut has_majority = false;
                    for &w in &g[v] {
                        if par == w || vis[w] { continue; }
                        if dp[w] > sz / 2 {
                            par = v;
                            v = w;
                            has_majority = true;
                            break;
                        }
                    }
                    if !has_majority {
                        return v;
                    }
                }
            };
            find_centroid(v, n)
        };
        if par < n {
            ch[par].push(cent);
        }
        // v was selected as a centroid
        // and will be ignored in the following decomposition procedure
        vis[cent] = true;
        for &w in &g[cent] {
            if !vis[w] {
                centroid_decompose_inner(g, w, cent, ch, dp, vis);
            }
        }
        cent
    }
    let n = g.len();
    let mut ch = vec![vec![]; n];
    // This Vec is used across multiple calls to `centroid_decompose_inner`
    let mut dp = vec![0; n];
    let mut vis = vec![false; n];
    let root = centroid_decompose_inner(&g, 0, n, &mut ch, &mut dp, &mut vis);
    (root, ch)
}

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

fn dfs(v: usize, par: usize, g: &[Vec<usize>], s: &[char], vis: &[bool], cur: i32, agg: &mut Vec<i32>) {
    let cur = if s[v] == '1' { cur + 1 } else { cur - 1 };
    agg.push(cur);
    for &w in &g[v] {
        if par == w || vis[w] { continue; }
        dfs(w, v, g, s, vis, cur, agg);
    }
}

fn calc_comb(init: i32, mut comb: Vec<i32>) -> i64 {
    comb.sort_unstable();
    let mut ret = 0;
    for &v in &comb {
        let idx = comb.lower_bound(&(-init - v + 1));
        ret += (comb.len() - idx) as i64;
    }
    ret
}

// https://yukicoder.me/problems/no/2892 (4)
fn solve() {
    input! {
        n: usize,
        uv: [(usize1, usize1); n - 1],
        s: chars,
    }
    let mut g = vec![vec![]; n];
    for &(u, v) in &uv {
        g[u].push(v);
        g[v].push(u);
    }
    let (root, ch) = centroid_decompose(&g);
    let mut vis = vec![false; n];
    let mut que = vec![root];
    let mut tot = 0;
    while let Some(v) = que.pop() {
        assert!(!vis[v]);
        vis[v] = true;
        for &w in &ch[v] {
            que.push(w);
        }
        // search
        let mut agg = vec![];
        let init = if s[v] == '1' { 1 } else { -1 };
        for &c in &ch[v] {
            let mut me = vec![];
            dfs(c, v, &g, &s, &vis, 0, &mut me);
            agg.extend_from_slice(&me);
            tot -= calc_comb(init, me);
        }
        if init == 1 {
            tot += 2;
        }
        for &a in &agg {
            if init + a > 0 {
                tot += 2;
            }
        }
        tot += calc_comb(init, agg);
    }
    assert!(vis.iter().all(|&x| x));
    println!("{}", tot / 2);
}
0