Struct Count01 

struct Count01 {
    cnt0: usize,
    cnt1: usize,
}

Fields

cnt0: usize

cnt1: usize

Implementations

impl Count01

pub fn new(cnt0: usize, cnt1: usize) -> Self

Examples found in repository

crates/competitive/src/algorithm/solve_01_on_tree.rs (line 53)

pub fn solve_01_on_tree(
    n: usize,
    c01: impl Fn(usize) -> (usize, usize),
    root: usize,
    parent: impl Fn(usize) -> usize,
) -> (usize, Vec<usize>) {
    pub type UF<T, M> =
        UnionFindBase<(), union_find::PathCompression, union_find::FnMerger<T, M>, (), ()>;
    let mut cost = 0usize;
    let c01 = |u| {
        let c = c01(u);
        Count01::new(c.0, c.1)
    };
    let mut uf = UF::new_with_merger(n, &c01, |x, y| {
        cost += x.cnt1 * y.cnt0;
        *x += *y;
    });
    let mut label = vec![0; n];
    let mut heap = BinaryHeap::from_iter((0..n).filter(|&u| u != root).map(|u| (c01(u), u, 0)));
    let mut next: Vec<_> = (0..n).collect();
    let mut ord = Vec::with_capacity(n);
    while let Some((_c, u, l)) = heap.pop() {
        if label[u] != l {
            continue;
        }
        let p = uf.find_root(parent(u));
        uf.unite(u, p);
        if !uf.same(p, root) {
            label[p] += 1;
            heap.push((*uf.merge_data(p), p, label[p]));
        }
        next.swap(u, p);
    }
    let mut u = next[root];
    ord.push(u);
    while u != root {
        u = next[u];
        ord.push(u);
    }
    ord.reverse();
    (cost, ord)
}

Trait Implementations

impl AddAssign for Count01

fn add_assign(&mut self, other: Self)

Performs the += operation.

impl Clone for Count01

fn clone(&self) -> Count01

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Count01

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Count01

fn default() -> Count01

Returns the “default value” for a type.

impl Ord for Count01

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Count01

fn eq(&self, other: &Count01) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for Count01

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for Count01

impl Eq for Count01

impl StructuralPartialEq for Count01