#931552 (Rust) No.2549 Paint Eggs

• 問題: No.2549 Paint Eggs
• ユーザー: tipstar0125
• 提出日時: 2023-11-25 14:53:33
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 36 ms / 2,000 ms
• コード長: 5,431 bytes
• コンパイル時間: 22,847 ms
• コンパイル使用メモリ: 377,956 KB
• 実行使用メモリ: 6,784 KB
• 最終ジャッジ日時: 2024-09-26 10:48:41
• 合計ジャッジ時間: 20,679 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	2 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	2 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	29 ms; 5,760 KB
testcase_11	AC	25 ms; 5,760 KB
testcase_12	AC	21 ms; 5,376 KB
testcase_13	AC	26 ms; 5,632 KB
testcase_14	AC	19 ms; 5,376 KB
testcase_15	AC	3 ms; 5,376 KB
testcase_16	AC	25 ms; 5,376 KB
testcase_17	AC	17 ms; 5,376 KB
testcase_18	AC	15 ms; 5,376 KB
testcase_19	AC	21 ms; 5,376 KB
testcase_20	AC	35 ms; 6,528 KB
testcase_21	AC	36 ms; 6,656 KB
testcase_22	AC	36 ms; 6,528 KB
testcase_23	AC	35 ms; 6,528 KB
testcase_24	AC	35 ms; 6,528 KB
testcase_25	AC	34 ms; 6,528 KB
testcase_26	AC	34 ms; 6,656 KB
testcase_27	AC	35 ms; 6,656 KB
testcase_28	AC	35 ms; 6,528 KB
testcase_29	AC	34 ms; 6,656 KB
testcase_30	AC	35 ms; 6,656 KB
testcase_31	AC	35 ms; 6,784 KB
testcase_32	AC	35 ms; 6,528 KB
testcase_33	AC	35 ms; 6,656 KB
testcase_34	AC	35 ms; 6,528 KB
testcase_35	AC	35 ms; 6,528 KB
testcase_36	AC	35 ms; 6,528 KB
testcase_37	AC	36 ms; 6,656 KB
testcase_38	AC	34 ms; 6,656 KB
testcase_39	AC	34 ms; 6,528 KB
testcase_40	AC	36 ms; 6,656 KB
testcase_41	AC	36 ms; 6,656 KB
testcase_42	AC	36 ms; 6,528 KB
testcase_43	AC	36 ms; 6,656 KB
testcase_44	AC	36 ms; 6,528 KB

ソースコード

#![allow(non_snake_case)]
#![allow(unused_imports)]
#![allow(unused_macros)]
#![allow(clippy::needless_range_loop)]
#![allow(clippy::comparison_chain)]
#![allow(clippy::nonminimal_bool)]
#![allow(clippy::neg_multiply)]
#![allow(dead_code)]
use std::cmp::Reverse;
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, VecDeque};

#[derive(Default)]
struct Solver {}
impl Solver {
    fn solve(&mut self) {
        input! {
            N: usize,
            M: usize,
            K: usize,
            C: [usize; N],
            A: [usize; M]
        }

        let mut cnt = vec![0; M + 1];
        for i in 0..K {
            cnt[C[i]] += 1;
        }
        let mut ans = 1_usize << 60;

        for i in 1..=M {
            ans = min!(ans, (K - cnt[i]) * A[i - 1]);
        }

        for i in 1..N - K + 1 {
            let c = C[i - 1];
            cnt[c] -= 1;
            let c = C[i + K - 1];
            cnt[c] += 1;
            ans = min!(ans, (K - cnt[c]) * A[c - 1]);
        }
        println!("{}", ans);
    }
}

#[macro_export]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $( $y: expr ),+) => {
        std::cmp::max($x, max!($( $y ),+))
    }
}
#[macro_export]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $( $y: expr ),+) => {
        std::cmp::min($x, min!($( $y ),+))
    }
}

fn main() {
    std::thread::Builder::new()
        .stack_size(128 * 1024 * 1024)
        .spawn(|| Solver::default().solve())
        .unwrap()
        .join()
        .unwrap();
}

#[macro_export]
macro_rules! input {
    () => {};
    (mut $var:ident: $t:tt, $($rest:tt)*) => {
        let mut $var = __input_inner!($t);
        input!($($rest)*)
    };
    ($var:ident: $t:tt, $($rest:tt)*) => {
        let $var = __input_inner!($t);
        input!($($rest)*)
    };
    (mut $var:ident: $t:tt) => {
        let mut $var = __input_inner!($t);
    };
    ($var:ident: $t:tt) => {
        let $var = __input_inner!($t);
    };
}

#[macro_export]
macro_rules! __input_inner {
    (($($t:tt),*)) => {
        ($(__input_inner!($t)),*)
    };
    ([$t:tt; $n:expr]) => {
        (0..$n).map(|_| __input_inner!($t)).collect::<Vec<_>>()
    };
    ([$t:tt]) => {{
        let n = __input_inner!(usize);
        (0..n).map(|_| __input_inner!($t)).collect::<Vec<_>>()
    }};
    (chars) => {
        __input_inner!(String).chars().collect::<Vec<_>>()
    };
    (bytes) => {
        __input_inner!(String).into_bytes()
    };
    (usize1) => {
        __input_inner!(usize) - 1
    };
    ($t:ty) => {
        $crate::read::<$t>()
    };
}

#[macro_export]
macro_rules! println {
    () => {
        $crate::write(|w| {
            use std::io::Write;
            std::writeln!(w).unwrap()
        })
    };
    ($($arg:tt)*) => {
        $crate::write(|w| {
            use std::io::Write;
            std::writeln!(w, $($arg)*).unwrap()
        })
    };
}

#[macro_export]
macro_rules! print {
    ($($arg:tt)*) => {
        $crate::write(|w| {
            use std::io::Write;
            std::write!(w, $($arg)*).unwrap()
        })
    };
}

#[macro_export]
macro_rules! flush {
    () => {
        $crate::write(|w| {
            use std::io::Write;
            w.flush().unwrap()
        })
    };
}

pub fn read<T>() -> T
where
    T: std::str::FromStr,
    T::Err: std::fmt::Debug,
{
    use std::cell::RefCell;
    use std::io::*;

    thread_local! {
        pub static STDIN: RefCell<StdinLock<'static>> = RefCell::new(stdin().lock());
    }

    STDIN.with(|r| {
        let mut r = r.borrow_mut();
        let mut s = vec![];
        loop {
            let buf = r.fill_buf().unwrap();
            if buf.is_empty() {
                break;
            }
            if let Some(i) = buf.iter().position(u8::is_ascii_whitespace) {
                s.extend_from_slice(&buf[..i]);
                r.consume(i + 1);
                if !s.is_empty() {
                    break;
                }
            } else {
                s.extend_from_slice(buf);
                let n = buf.len();
                r.consume(n);
            }
        }
        std::str::from_utf8(&s).unwrap().parse().unwrap()
    })
}

pub fn write<F>(f: F)
where
    F: FnOnce(&mut std::io::BufWriter<std::io::StdoutLock>),
{
    use std::cell::RefCell;
    use std::io::*;

    thread_local! {
        pub static STDOUT: RefCell<BufWriter<StdoutLock<'static>>> =
            RefCell::new(BufWriter::new(stdout().lock()));
    }

    STDOUT.with(|w| f(&mut w.borrow_mut()))
}

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

impl<T: PartialOrd> Bound<T> for [T] {
    fn lower_bound(&self, x: &T) -> usize {
        let (mut low, mut high) = (0, self.len());
        while low + 1 < high {
            let mid = (low + high) / 2;
            if self[mid] < *x {
                low = mid;
            } else {
                high = mid;
            }
        }
        if self[low] < *x {
            low + 1
        } else {
            low
        }
    }

    fn upper_bound(&self, x: &T) -> usize {
        let (mut low, mut high) = (0, self.len());
        while low + 1 < high {
            let mid = (low + high) / 2;
            if self[mid] <= *x {
                low = mid;
            } else {
                high = mid;
            }
        }
        if self[low] <= *x {
            low + 1
        } else {
            low
        }
    }
}