#716028 (Rust) No.1739 Princess vs. Dragoness (& AoE)

• 問題: No.1739 Princess vs. Dragoness (& AoE)
• ユーザー: manta1130
• 提出日時: 2021-11-12 23:46:30
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 246 ms / 3,000 ms
• コード長: 6,034 bytes
• コンパイル時間: 11,887 ms
• コンパイル使用メモリ: 399,728 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-05-04 11:39:24
• 合計ジャッジ時間: 18,712 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,816 KB
testcase_02	AC	0 ms; 6,816 KB
testcase_03	AC	1 ms; 6,944 KB
testcase_04	AC	245 ms; 6,940 KB
testcase_05	AC	246 ms; 6,944 KB
testcase_06	AC	42 ms; 6,944 KB
testcase_07	AC	1 ms; 6,944 KB
testcase_08	AC	132 ms; 6,944 KB
testcase_09	AC	214 ms; 6,940 KB
testcase_10	AC	86 ms; 6,944 KB
testcase_11	AC	62 ms; 6,940 KB
testcase_12	AC	5 ms; 6,940 KB
testcase_13	AC	144 ms; 6,944 KB
testcase_14	AC	175 ms; 6,944 KB
testcase_15	AC	244 ms; 6,944 KB
testcase_16	AC	62 ms; 6,940 KB
testcase_17	AC	116 ms; 6,944 KB
testcase_18	AC	118 ms; 6,940 KB
testcase_19	AC	96 ms; 6,944 KB
testcase_20	AC	48 ms; 6,944 KB
testcase_21	AC	185 ms; 6,940 KB
testcase_22	AC	219 ms; 6,944 KB
testcase_23	AC	245 ms; 6,940 KB
testcase_24	AC	243 ms; 6,940 KB
testcase_25	AC	243 ms; 6,940 KB
testcase_26	AC	238 ms; 6,944 KB
testcase_27	AC	245 ms; 6,940 KB
testcase_28	AC	240 ms; 6,944 KB
testcase_29	AC	242 ms; 6,940 KB
testcase_30	AC	245 ms; 6,944 KB
testcase_31	AC	243 ms; 6,940 KB
testcase_32	AC	237 ms; 6,940 KB
testcase_33	AC	1 ms; 6,940 KB
testcase_34	AC	1 ms; 6,940 KB
testcase_35	AC	1 ms; 6,944 KB
testcase_36	AC	1 ms; 6,944 KB
testcase_37	AC	0 ms; 6,940 KB
testcase_38	AC	1 ms; 6,940 KB
testcase_39	AC	2 ms; 6,944 KB
testcase_40	AC	1 ms; 6,944 KB
testcase_41	AC	1 ms; 6,940 KB
testcase_42	AC	1 ms; 6,940 KB

ソースコード

#[allow(unused_imports)]
use std::io::{stdout, BufWriter, Write};

fn func(mut a: i64, b: i64, x: i64, y: i64, mut h: Vec<i64>, k: i64) -> bool {
    let mut sum = y * b;

    for i in 0..h.len() {
        h[i] -= k;
        if h[i] < 0 {
            h[i] = 0;
        }
    }
    
        for i in h.iter_mut() {
            if *i == 0 {
                continue;
            }
            let count = *i / x;
            if count <= a {
                a -= count;
                *i -= count * x;
            } else {
                *i -= a * x;
                a = 0;
            }
        }
    
     h.sort();
    h.reverse();


    for i in h.iter_mut() {
        if *i == 0 {
            continue;
        }
        let count = (*i + x - 1) / x;
        if count <= a {
            a -= count;
            *i = 0;
        } else {
            *i -= a * x;
            a = 0;
        }
    }

    for i in h.iter_mut() {
        if sum >= *i {
            sum -= *i;
            *i = 0;
        } else {
            *i -= sum;
            sum = 0;
        }
    }

    if h.iter().all(|q| *q == 0) {
        true
    } else {
        false
    }
}

fn main() {
    let out = stdout();
    let mut out = BufWriter::new(out.lock());

    inputv! {
        _n:usize,a:i64,b:i64,x:i64,y:i64,
    }
    let h = input_vector::<i64>();

    let mut ok = 1_000_000_000;
    let mut ng = -1;

    while ok - ng > 1 {
        let mid = (ok + ng) / 2;
        if func(a, b, x, y, h.clone(), mid) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    writeln!(out, "{}", ok).unwrap();
}

//https://github.com/manta1130/competitive-template-rs

use input::*;

pub mod input {
    use std::cell::RefCell;
    use std::io;
    pub const SPLIT_DELIMITER: char = ' ';
    pub use std::io::prelude::*;

    thread_local! {
        pub static INPUT_BUFFER:RefCell<std::collections::VecDeque<String>>=RefCell::new(std::collections::VecDeque::new());
    }

    #[macro_export]
    macro_rules! input_internal {
        ($x:ident : $t:ty) => {
            INPUT_BUFFER.with(|p| {
                if p.borrow().len() == 0 {
                    let temp_str = input_line_str();
                    let mut split_result_iter = temp_str
                        .split(SPLIT_DELIMITER)
                        .map(|q| q.to_string())
                        .collect::<std::collections::VecDeque<_>>();
                    p.borrow_mut().append(&mut split_result_iter)
                }
            });
            let mut buf_split_result = String::new();
            INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());
            let $x: $t = buf_split_result.parse().unwrap();
        };
        (mut $x:ident : $t:ty) => {
            INPUT_BUFFER.with(|p| {
                if p.borrow().len() == 0 {
                    let temp_str = input_line_str();
                    let mut split_result_iter = temp_str
                        .split(SPLIT_DELIMITER)
                        .map(|q| q.to_string())
                        .collect::<std::collections::VecDeque<_>>();
                    p.borrow_mut().append(&mut split_result_iter)
                }
            });
            let mut buf_split_result = String::new();
            INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());
            let mut $x: $t = buf_split_result.parse().unwrap();
        };
    }

    pub fn input_buffer_is_empty() -> bool {
        let mut empty = false;
        INPUT_BUFFER.with(|p| {
            if p.borrow().len() == 0 {
                empty = true;
            }
        });
        empty
    }

    #[macro_export]
    macro_rules! inputv {
    ($i:ident : $t:ty) => {
        input_internal!{$i : $t}
    };
    (mut $i:ident : $t:ty) => {
        input_internal!{mut $i : $t}
    };
    ($i:ident : $t:ty $(,)*) => {
            input_internal!{$i : $t}
    };
    (mut $i:ident : $t:ty $(,)*) => {
            input_internal!{mut $i : $t}
    };
    (mut $i:ident : $t:ty,$($q:tt)*) => {
            input_internal!{mut $i : $t}
            inputv!{$($q)*}
    };
    ($i:ident : $t:ty,$($q:tt)*) => {
            input_internal!{$i : $t}
            inputv!{$($q)*}
    };
}

    pub fn input_all() {
        INPUT_BUFFER.with(|p| {
            if p.borrow().len() == 0 {
                let mut temp_str = String::new();
                std::io::stdin().read_to_string(&mut temp_str).unwrap();
                let mut split_result_iter = temp_str
                    .split_whitespace()
                    .map(|q| q.to_string())
                    .collect::<std::collections::VecDeque<_>>();
                p.borrow_mut().append(&mut split_result_iter)
            }
        });
    }

    pub fn input_line_str() -> String {
        let mut s = String::new();
        io::stdin().read_line(&mut s).unwrap();
        s.trim().to_string()
    }

    #[allow(clippy::match_wild_err_arm)]
    pub fn input_vector<T>() -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<T> = Vec::new();

        let s = input_line_str();
        let split_result = s.split(SPLIT_DELIMITER);
        for z in split_result {
            let buf = match z.parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error",),
            };
            v.push(buf);
        }
        v
    }

    #[allow(clippy::match_wild_err_arm)]
    pub fn input_vector_row<T>(n: usize) -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v = Vec::with_capacity(n);
        for _ in 0..n {
            let buf = match input_line_str().parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error",),
            };
            v.push(buf);
        }
        v
    }

    pub trait ToCharVec {
        fn to_charvec(&self) -> Vec<char>;
    }

    impl ToCharVec for String {
        fn to_charvec(&self) -> Vec<char> {
            self.to_string().chars().collect::<Vec<_>>()
        }
    }
}