結果

問題 No.2918 Divide Applicants Fairly
ユーザー 👑 ArcAki
提出日時 2026-01-22 11:24:53
言語 Rust
(1.92.0 + proconio + num + itertools)
結果
AC  
実行時間 999 ms / 2,000 ms
コード長 5,739 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 28,898 ms
コンパイル使用メモリ 412,492 KB
実行使用メモリ 10,624 KB
最終ジャッジ日時 2026-01-22 17:54:20
合計ジャッジ時間 33,198 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 61
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#[allow(unused_imports)]
use std::{
    convert::{Infallible, TryFrom, TryInto as _}, fmt::{self, Debug, Display, Formatter,},
    fs::File, hash::{Hash, Hasher, BuildHasherDefault}, iter::{Product, Sum}, marker::PhantomData,
    ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, RangeBounds},
    str::FromStr, sync::{atomic::{self, AtomicU32, AtomicU64}, Once},
    collections::{*, btree_set::Range, btree_map::Range as BTreeRange}, mem::{swap},
    cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
    thread::LocalKey, f64::consts::PI, time::Instant, cell::RefCell,
    io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write},
};
pub trait SortD{ fn sort_d(&mut self); }
impl<T: Ord> SortD for Vec<T>{ fn sort_d(&mut self) {
    self.sort_by(|u, v| v.cmp(&u));
} }
pub trait Mx{fn max(&self, rhs: Self)->Self;}
impl Mx for f64{ fn max(&self, rhs: Self)->Self{if *self < rhs{ rhs } else { *self } }}
pub trait Mi{ fn min(&self, rhs: Self)->Self; }
impl Mi for f64{ fn min(&self, rhs: Self)->Self{ if *self > rhs{ rhs } else { *self } } }

pub trait Chmax: PartialOrd + Copy {
    fn chmax(&mut self, rhs: Self) {
        if *self < rhs { *self = rhs; }
    }
}
impl<T: PartialOrd + Copy> Chmax for T {}

pub trait Chmin: PartialOrd + Copy {
    fn chmin(&mut self, rhs: Self) {
        if *self > rhs { *self = rhs; }
    }
}
impl<T: PartialOrd + Copy> Chmin for T {}

#[allow(unused_imports)]
use proconio::{input, input_interactive, marker::{*}, fastout};
/* 
#[allow(unused_imports)]
use rustc_hash::FxHasher;
#[allow(dead_code)]
type FxMap<K, V> = HashMap<K, V, BuildHasherDefault<FxHasher>>;
#[allow(dead_code)]
type FxSet<K> = HashSet<K, BuildHasherDefault<FxHasher>>;
#[allow(unused_imports)]
use rand::{rng, Rng, seq::SliceRandom, prelude::*, *};
#[allow(unused_imports)]
use itertools::Itertools;
#[allow(unused_imports)]
use ordered_float::OrderedFloat;
#[allow(unused_imports)]
use num_bigint::BigInt;
#[allow(unused_imports)]
use ac_library::{*, modint::ModInt998244353 as Mint};type MI = StaticModInt<Mod998244353>;pub fn factorial_mint(n: usize)->(Vec<MI>, Vec<MI>){ let mut res = vec![MI::new(1); n+1];let mut inv = vec![MI::new(1); n+1];for i in 0..n{res[i+1] = res[i]*(i+1);}inv[n] = MI::new(1)/res[n];for i in (0..n).rev(){inv[i] = inv[i+1]*(i+1);}(res, inv)}pub fn cm(a: usize, b: usize, mf: &(Vec<MI>, Vec<MI>))->MI{if a<b{MI::new(0)}else{mf.0[a]*mf.1[b]*mf.1[a-b]}}
*/
#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const I: i32 = 1<<29;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];
#[allow(dead_code)]
pub fn c2d(c: u8)->(usize, usize){match c{b'U'=>(!0,0),b'D'=>(1,0),b'L'=>(0,!0),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
pub fn c2d_i64(c: u8)->(i64, i64){match c{b'U'=>(-1,0),b'D'=>(1,0),b'L'=>(0,-1),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !0)];

const MULTI: bool = false;
#[fastout]
fn solve(){
    input!{
        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);
        } 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 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);
}

//#[fastout]
fn main() {
    if MULTI{
        input!{
            t: usize,
        }
        for _ in 0..t{
            solve();
        }
    } else {
        solve();
    }
}
0