#1016149 (Rust) No.2918 Divide Applicants Fairly

• 問題: No.2918 Divide Applicants Fairly
• ユーザー: ArcAki
• 提出日時: 2024-10-08 13:35:38
• 言語: Rust (1.77.0 + proconio)
• 結果: WA
• 実行時間: -
• コード長: 4,482 bytes
• コンパイル時間: 13,076 ms
• コンパイル使用メモリ: 378,724 KB
• 実行使用メモリ: 10,496 KB
• 最終ジャッジ日時: 2024-10-08 13:36:01
• 合計ジャッジ時間: 18,403 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	1 ms; 5,248 KB
testcase_04	AC	1 ms; 5,248 KB
testcase_05	AC	1 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	1 ms; 5,248 KB
testcase_08	AC	1 ms; 5,248 KB
testcase_09	AC	8 ms; 5,248 KB
testcase_10	AC	1 ms; 5,248 KB
testcase_11	AC	409 ms; 10,368 KB
testcase_12	AC	5 ms; 5,248 KB
testcase_13	AC	2 ms; 5,248 KB
testcase_14	AC	1 ms; 5,248 KB
testcase_15	AC	1 ms; 5,248 KB
testcase_16	AC	1 ms; 5,248 KB
testcase_17	AC	4 ms; 5,248 KB
testcase_18	AC	414 ms; 10,496 KB
testcase_19	AC	1 ms; 5,248 KB
testcase_20	AC	258 ms; 5,248 KB
testcase_21	AC	5 ms; 5,248 KB
testcase_22	AC	1 ms; 5,248 KB
testcase_23	AC	8 ms; 5,248 KB
testcase_24	AC	1 ms; 5,248 KB
testcase_25	AC	981 ms; 10,368 KB
testcase_26	AC	1 ms; 5,248 KB
testcase_27	AC	120 ms; 5,248 KB
testcase_28	AC	1 ms; 5,248 KB
testcase_29	AC	2 ms; 5,248 KB
testcase_30	AC	1 ms; 5,248 KB
testcase_31	AC	2 ms; 5,248 KB
testcase_32	AC	1 ms; 5,248 KB
testcase_33	AC	1 ms; 5,248 KB
testcase_34	AC	1 ms; 5,248 KB
testcase_35	AC	1 ms; 5,248 KB
testcase_36	AC	80 ms; 5,248 KB
testcase_37	WA	-
testcase_38	WA	-
testcase_39	AC	1 ms; 5,248 KB
testcase_40	AC	14 ms; 5,248 KB
testcase_41	AC	33 ms; 5,248 KB
testcase_42	AC	46 ms; 5,248 KB
testcase_43	AC	102 ms; 5,248 KB
testcase_44	AC	139 ms; 5,248 KB
testcase_45	AC	310 ms; 5,248 KB
testcase_46	AC	1 ms; 5,248 KB
testcase_47	AC	1 ms; 5,248 KB
testcase_48	AC	6 ms; 5,248 KB
testcase_49	AC	45 ms; 5,248 KB
testcase_50	AC	1 ms; 5,248 KB
testcase_51	WA	-
testcase_52	AC	35 ms; 5,248 KB
testcase_53	AC	8 ms; 5,248 KB
testcase_54	AC	7 ms; 5,248 KB
testcase_55	WA	-
testcase_56	WA	-
testcase_57	AC	117 ms; 5,248 KB
testcase_58	WA	-
testcase_59	AC	17 ms; 5,248 KB
testcase_60	AC	1 ms; 5,248 KB
testcase_61	AC	15 ms; 5,248 KB
testcase_62	AC	4 ms; 5,248 KB
testcase_63	AC	4 ms; 5,248 KB

ソースコード

#[allow(unused_imports)]
use std::{collections::
          {HashSet, HashMap, BinaryHeap, VecDeque, BTreeSet, BTreeMap},
          mem::{swap},
          cmp::{Reverse, Ordering, PartialOrd, PartialEq},
          fmt::{Debug},
          time::Instant};
//#[allow(unused_imports)]
//use rand::{Rng, thread_rng, seq::{SliceRandom, IndexedRandom}};

use std::io::{Read, BufReader, stdin};

struct InputReader<R: Read> {
    bytes: std::iter::Peekable<std::io::Bytes<BufReader<R>>>,
}
impl<R: Read> InputReader<R> {
    fn new(reader: R) -> Self {
        let reader = BufReader::new(reader);
        let bytes = reader.bytes().peekable();
        Self { bytes }
    }

    fn next_token(&mut self) -> String {
        self.bytes
            .by_ref()
            .map(|r| r.unwrap() as char)
            .take_while(|c| !c.is_whitespace())
            .collect()
    }
}
macro_rules! input {
    ($reader:expr, $($r:tt)*) => {
        let mut next = || $reader.next_token();
        input_inner!{next, $($r)*}
    };
}
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };
    ($next:expr, usize) => {
        $next().parse::<usize>().expect("Parse error")
    };
    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

fn main() {
    let stdin = stdin();
    let mut reader = InputReader::new(stdin.lock());
    input!{
        reader,
        n: usize,
        r: [i64; n],
    }
    if n > 25{
        println!("0");
        return;
    }
    let h1 = &r[..n/2];
    let h2 = &r[n/2..];
    let mut ans = 1<<60;
    let mut set1 = HashMap::new();
    let mut set2 = HashMap::new();
    let mut set3 = HashMap::new();
    for i in 0..3i64.pow(h1.len() as u32){
        let mut cnt = 0;
        let mut z = 0;
        let mut x = i;
        let (mut f1, mut f2) = (false, false);
        for j in 0..h1.len(){
            if x%3==0{
                f1 = true;
                z += h1[j];
                cnt += 1;
            } else if x%3==1{
                f2 = true;
                z -= h1[j];
                cnt -= 1;
            }
            x /= 3;
        }
        if f1 && f2{
            set1.entry(cnt).or_insert(BTreeSet::new()).insert(z);
            ans = ans.min(z.abs());
        } else if f1{
            set2.entry(cnt).or_insert(BTreeSet::new()).insert(z);
        } else if f2{
            set3.entry(cnt).or_insert(BTreeSet::new()).insert(z);
        }
    }
    for i in 0..3i64.pow(h2.len() as u32){
        let mut z = 0;
        let mut x = i;
        let mut cnt = 0;
        let (mut f1, mut f2) = (false, false);
        for j in 0..h2.len(){
            if x%3==0{
                f1 = true;
                z += h2[j];
                cnt -= 1;
            } else if x%3==1{
                f2 = true;
                z -= h2[j];
                cnt += 1;
            }
            x /= 3;
        }
        if f1 && f2{
            ans = ans.min(z.abs());
        }
        if let Some(v) = set1.get(&cnt){
            if let Some(&p) = v.range(-z..).next(){
                ans = ans.min((p+z).abs());
            }
            if let Some(&p) = v.range(..-z).next_back(){
                ans = ans.min((p+z).abs());
            }
        }
        if f1{
            if let Some(v) = set3.get(&cnt){
                if let Some(&p) = v.range(-z..).next(){
                    ans = ans.min((p+z).abs());
                }
                if let Some(&p) = v.range(..-z).next_back(){
                    ans = ans.min((p+z).abs());
                }
            }
        }
        if f2{
            if let Some(v) = set2.get(&cnt){
                if let Some(&p) = v.range(-z..).next(){
                    ans = ans.min((p+z).abs());
                }
                if let Some(&p) = v.range(..-z).next_back(){
                    ans = ans.min((p+z).abs());
                }
            }
        }
    }
    println!("{}", ans);
}