#1016047 (Rust) No.2918 Divide Applicants Fairly

• 問題: No.2918 Divide Applicants Fairly
• ユーザー: akakimidori
• 提出日時: 2024-10-07 22:20:09
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 18 ms / 2,000 ms
• コード長: 5,433 bytes
• コンパイル時間: 12,605 ms
• コンパイル使用メモリ: 392,464 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-10-07 22:20:26
• 合計ジャッジ時間: 14,450 ms
• ジャッジサーバーID （参考情報）: judge3 / 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	AC	1 ms; 6,816 KB
testcase_05	AC	1 ms; 6,820 KB
testcase_06	AC	1 ms; 6,816 KB
testcase_07	AC	1 ms; 6,816 KB
testcase_08	AC	1 ms; 6,816 KB
testcase_09	AC	1 ms; 6,816 KB
testcase_10	AC	1 ms; 6,820 KB
testcase_11	AC	1 ms; 6,816 KB
testcase_12	AC	2 ms; 6,816 KB
testcase_13	AC	2 ms; 6,820 KB
testcase_14	AC	1 ms; 6,816 KB
testcase_15	AC	1 ms; 6,816 KB
testcase_16	AC	1 ms; 6,816 KB
testcase_17	AC	1 ms; 6,816 KB
testcase_18	AC	1 ms; 6,816 KB
testcase_19	AC	1 ms; 6,816 KB
testcase_20	AC	1 ms; 6,816 KB
testcase_21	AC	1 ms; 6,820 KB
testcase_22	AC	1 ms; 6,816 KB
testcase_23	AC	1 ms; 6,816 KB
testcase_24	AC	1 ms; 6,816 KB
testcase_25	AC	1 ms; 6,816 KB
testcase_26	AC	1 ms; 6,816 KB
testcase_27	AC	1 ms; 6,816 KB
testcase_28	AC	1 ms; 6,816 KB
testcase_29	AC	1 ms; 6,820 KB
testcase_30	AC	1 ms; 6,820 KB
testcase_31	AC	2 ms; 6,816 KB
testcase_32	AC	1 ms; 6,816 KB
testcase_33	AC	1 ms; 6,816 KB
testcase_34	AC	1 ms; 6,816 KB
testcase_35	AC	1 ms; 6,816 KB
testcase_36	AC	18 ms; 6,816 KB
testcase_37	AC	10 ms; 6,820 KB
testcase_38	AC	6 ms; 6,820 KB
testcase_39	AC	1 ms; 6,820 KB
testcase_40	AC	1 ms; 6,816 KB
testcase_41	AC	1 ms; 6,816 KB
testcase_42	AC	1 ms; 6,816 KB
testcase_43	AC	1 ms; 6,816 KB
testcase_44	AC	1 ms; 6,816 KB
testcase_45	AC	1 ms; 6,816 KB
testcase_46	AC	1 ms; 6,816 KB
testcase_47	AC	1 ms; 6,816 KB
testcase_48	AC	1 ms; 6,820 KB
testcase_49	AC	10 ms; 6,820 KB
testcase_50	AC	1 ms; 6,820 KB
testcase_51	AC	1 ms; 6,816 KB
testcase_52	AC	1 ms; 6,816 KB
testcase_53	AC	1 ms; 6,816 KB
testcase_54	AC	1 ms; 6,816 KB
testcase_55	AC	3 ms; 6,820 KB
testcase_56	AC	3 ms; 6,816 KB
testcase_57	AC	1 ms; 6,824 KB
testcase_58	AC	3 ms; 6,820 KB
testcase_59	AC	3 ms; 6,816 KB
testcase_60	AC	1 ms; 6,816 KB
testcase_61	AC	1 ms; 6,820 KB
testcase_62	AC	1 ms; 6,820 KB
testcase_63	AC	1 ms; 6,820 KB

ソースコード

fn main() {
    input! {
        n: usize,
        r: [usize; n],
    }
    let mut r = r;
    let m = n / 2;
    r.sort();
    let size = r.iter().rev().take(m).sum::<usize>();
    let w = 8 * std::mem::size_of::<usize>();
    let mut dp = vec![0usize; size / w + 1];
    let mut a = vec![0; n];
    a[..m].fill(1);
    a.sort();
    while {
        let s = a.iter().zip(r.iter()).filter(|p| *p.0 == 1).map(|p| *p.1).sum::<usize>();
        if dp[s / w] >> (s % w) & 1 == 1 {
            println!("0");
            return;
        }
        dp[s / w] |= 1 << (s % w);
        a.next_permutation()
    } {}
    let mut ans = std::usize::MAX;
    let mut up = std::usize::MAX;
    for (i, &dp) in dp.iter().enumerate().rev() {
        let mut v = dp;
        while v > 0 {
            let k = v.leading_zeros() as usize;
            v ^= 1 << (w - 1 - k);
            let u = i * w + w - 1 - k;
            ans = ans.min(up - u);
            up = u;
        }
    }
    println!("{}", ans);
}

// ---------- 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 super slice ----------
pub trait SuperSlice {
    type Item;
    fn lower_bound(&self, key: &Self::Item) -> usize
    where
        Self::Item: Ord;
    fn lower_bound_by<F>(&self, f: F) -> usize
    where
        F: FnMut(&Self::Item) -> std::cmp::Ordering;
    fn lower_bound_by_key<K, F>(&self, key: &K, f: F) -> usize
    where
        K: Ord,
        F: FnMut(&Self::Item) -> K;
    fn upper_bound(&self, key: &Self::Item) -> usize
    where
        Self::Item: Ord;
    fn upper_bound_by<F>(&self, f: F) -> usize
    where
        F: FnMut(&Self::Item) -> std::cmp::Ordering;
    fn upper_bound_by_key<K, F>(&self, key: &K, f: F) -> usize
    where
        K: Ord,
        F: FnMut(&Self::Item) -> K;
    fn next_permutation(&mut self) -> bool
    where
        Self::Item: Ord;
    fn next_permutation_by<F>(&mut self, f: F) -> bool
    where
        F: FnMut(&Self::Item, &Self::Item) -> std::cmp::Ordering;
    fn prev_permutation(&mut self) -> bool
    where
        Self::Item: Ord;
}

impl<T> SuperSlice for [T] {
    type Item = T;
    fn lower_bound(&self, key: &Self::Item) -> usize
    where
        T: Ord,
    {
        self.lower_bound_by(|p| p.cmp(key))
    }
    fn lower_bound_by<F>(&self, mut f: F) -> usize
    where
        F: FnMut(&Self::Item) -> std::cmp::Ordering,
    {
        self.binary_search_by(|p| f(p).then(std::cmp::Ordering::Greater))
            .unwrap_err()
    }
    fn lower_bound_by_key<K, F>(&self, key: &K, mut f: F) -> usize
    where
        K: Ord,
        F: FnMut(&Self::Item) -> K,
    {
        self.lower_bound_by(|p| f(p).cmp(key))
    }
    fn upper_bound(&self, key: &Self::Item) -> usize
    where
        T: Ord,
    {
        self.upper_bound_by(|p| p.cmp(key))
    }
    fn upper_bound_by<F>(&self, mut f: F) -> usize
    where
        F: FnMut(&Self::Item) -> std::cmp::Ordering,
    {
        self.binary_search_by(|p| f(p).then(std::cmp::Ordering::Less))
            .unwrap_err()
    }
    fn upper_bound_by_key<K, F>(&self, key: &K, mut f: F) -> usize
    where
        K: Ord,
        F: FnMut(&Self::Item) -> K,
    {
        self.upper_bound_by(|p| f(p).cmp(key))
    }
    fn next_permutation(&mut self) -> bool
    where
        T: Ord,
    {
        self.next_permutation_by(|a, b| a.cmp(b))
    }
    fn next_permutation_by<F>(&mut self, mut f: F) -> bool
    where
        F: FnMut(&Self::Item, &Self::Item) -> std::cmp::Ordering,
    {
        use std::cmp::Ordering::*;
        if let Some(x) = self.windows(2).rposition(|a| f(&a[0], &a[1]) == Less) {
            let y = self.iter().rposition(|b| f(&self[x], b) == Less).unwrap();
            self.swap(x, y);
            self[(x + 1)..].reverse();
            true
        } else {
            self.reverse();
            false
        }
    }
    fn prev_permutation(&mut self) -> bool
    where
        T: Ord,
    {
        self.next_permutation_by(|a, b| a.cmp(b).reverse())
    }
}
// ---------- end super slice ----------