#846881 (Rust) No.2221 Set X

• 問題: No.2221 Set X
• ユーザー: akakimidori
• 提出日時: 2023-03-08 22:25:47
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 150 ms / 2,000 ms
• コード長: 4,913 bytes
• コンパイル時間: 14,217 ms
• コンパイル使用メモリ: 380,164 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-18 02:40:18
• 合計ジャッジ時間: 17,727 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	1 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	54 ms; 5,376 KB
testcase_17	AC	19 ms; 5,376 KB
testcase_18	AC	65 ms; 5,376 KB
testcase_19	AC	18 ms; 5,376 KB
testcase_20	AC	36 ms; 5,376 KB
testcase_21	AC	48 ms; 5,376 KB
testcase_22	AC	65 ms; 5,376 KB
testcase_23	AC	4 ms; 5,376 KB
testcase_24	AC	44 ms; 5,376 KB
testcase_25	AC	26 ms; 5,376 KB
testcase_26	AC	123 ms; 5,376 KB
testcase_27	AC	150 ms; 5,376 KB
testcase_28	AC	149 ms; 5,376 KB
testcase_29	AC	92 ms; 5,376 KB
testcase_30	AC	110 ms; 5,376 KB
testcase_31	AC	141 ms; 5,376 KB
testcase_32	AC	79 ms; 5,376 KB
testcase_33	AC	85 ms; 5,376 KB
testcase_34	AC	78 ms; 5,376 KB
testcase_35	AC	76 ms; 5,376 KB
testcase_36	AC	96 ms; 5,376 KB
testcase_37	AC	101 ms; 5,376 KB
testcase_38	AC	97 ms; 5,376 KB
testcase_39	AC	118 ms; 5,376 KB
testcase_40	AC	135 ms; 5,376 KB
testcase_41	AC	115 ms; 5,376 KB
testcase_42	AC	116 ms; 5,376 KB

ソースコード

fn main() {
    input! {
        n: usize,
        a: [usize; n],
    }
    let mut ans = (2 * n, 1);
    for x in 2..(2 * n) {
        let mut c = 0;
        let mut pos = 0;
        while pos < n && c * (x + 1) < ans.0 {
            c += 1;
            let v = a[pos] / x;
            pos = a.lower_bound(&((v + 1) * x));
        }
        if pos == n && c * (x + 1) < ans.0 {
            ans = (c * (x + 1), x);
        }
    }
    println!("{}\n{}", ans.1, ans.0);
}

// ---------- 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 ----------