#588103 (Rust) No.972 選び方のスコア

• 問題: No.972 選び方のスコア
• ユーザー: cotton_fn_
• 提出日時: 2020-12-02 03:46:00
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 27 ms / 2,000 ms
• コード長: 10,198 bytes
• コンパイル時間: 14,358 ms
• コンパイル使用メモリ: 390,912 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-09-13 03:46:13
• 合計ジャッジ時間: 16,972 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	26 ms; 6,812 KB
testcase_01	AC	26 ms; 6,816 KB
testcase_02	AC	25 ms; 6,940 KB
testcase_03	AC	14 ms; 6,944 KB
testcase_04	AC	27 ms; 6,940 KB
testcase_05	AC	27 ms; 6,944 KB
testcase_06	AC	27 ms; 6,944 KB
testcase_07	AC	19 ms; 6,940 KB
testcase_08	AC	7 ms; 6,940 KB
testcase_09	AC	7 ms; 6,940 KB
testcase_10	AC	6 ms; 6,944 KB
testcase_11	AC	6 ms; 6,944 KB
testcase_12	AC	16 ms; 6,940 KB
testcase_13	AC	14 ms; 6,944 KB
testcase_14	AC	16 ms; 6,944 KB
testcase_15	AC	24 ms; 6,944 KB
testcase_16	AC	24 ms; 6,940 KB
testcase_17	AC	24 ms; 6,940 KB
testcase_18	AC	2 ms; 6,940 KB
testcase_19	AC	26 ms; 6,944 KB
testcase_20	AC	26 ms; 6,940 KB
testcase_21	AC	26 ms; 6,944 KB
testcase_22	AC	25 ms; 6,940 KB
testcase_23	AC	25 ms; 6,944 KB
testcase_24	AC	26 ms; 6,944 KB
testcase_25	AC	1 ms; 6,940 KB
testcase_26	AC	1 ms; 6,940 KB
testcase_27	AC	2 ms; 6,940 KB
testcase_28	AC	1 ms; 6,944 KB
testcase_29	AC	1 ms; 6,948 KB
testcase_30	AC	1 ms; 6,944 KB
testcase_31	AC	1 ms; 6,944 KB
testcase_32	AC	1 ms; 6,940 KB
testcase_33	AC	2 ms; 6,940 KB
testcase_34	AC	1 ms; 6,940 KB

ソースコード

#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn run<I: Input, O: Write>(mut kin: I, mut out: O) {
    let n: usize = kin.input();
    let mut a: Vec<i32> = kin.seq(n);
    a.sort_by_key(|x| -x);
    let mut l = 0;
    let mut lsum = 0i64;
    let mut rsum = 0i64;
    let mut ans = 0;
    for i in 0..a.len() - 1 {
        while i + l + 1 < a.len() && a[l] - a[i] > a[i] - a[i + l + 1] {
            lsum += a[l] as i64;
            rsum += a[i + l + 1] as i64;
            l += 1;
        }
        ans = ans.max(lsum + rsum - (2 * l as i64) * (a[i] as i64));
        if l > 0 {
            l -= 1;
            lsum -= a[l] as i64;
            rsum -= a[i + 1] as i64;
        }
    }
    outputln!(out, ans);
}

// -----------------------------------------------------------------------------
fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024)
        .spawn(|| {
            run(
                KInput::new(io::stdin()),
                io::BufWriter::new(io::stdout().lock()),
            )
        })?
        .join()
        .unwrap();
    Ok(())
}

// -----------------------------------------------------------------------------
pub mod kyoproio {
    use std::{
        io::prelude::*,
        iter::FromIterator,
        marker::PhantomData,
        mem::{self, MaybeUninit},
        ptr, slice, str,
    };
    pub trait Input {
        fn bytes(&mut self) -> &[u8];
        fn str(&mut self) -> &str {
            str::from_utf8(self.bytes()).unwrap()
        }
        fn input<T: InputItem>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputItem>(&mut self) -> Iter<T, Self> {
            Iter(self, PhantomData)
        }
        fn seq<T: InputItem, B: FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: Vec<u8>,
        pos: usize,
        len: usize,
    }
    impl<R: Read> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: vec![0; 1 << 16],
                pos: 0,
                len: 0,
            }
        }
    }
    impl<R: Read> Input for KInput<R> {
        fn bytes(&mut self) -> &[u8] {
            loop {
                while let Some(delim) = self.buf[self.pos..self.len]
                    .iter()
                    .position(|b| b.is_ascii_whitespace())
                {
                    let p = self.pos;
                    self.pos += delim + 1;
                    if delim > 0 {
                        return &self.buf[p..p + delim];
                    }
                }
                if self.read() == 0 {
                    return &self.buf[mem::replace(&mut self.pos, self.len)..self.len];
                }
            }
        }
    }
    impl<R: Read> KInput<R> {
        fn read(&mut self) -> usize {
            if self.pos > 0 {
                self.buf.copy_within(self.pos..self.len, 0);
                self.len -= self.pos;
                self.pos = 0;
            } else if self.len >= self.buf.len() {
                self.buf.resize(2 * self.buf.len(), 0);
            }
            let read = self.src.read(&mut self.buf[self.len..]).unwrap();
            self.len += read;
            read
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, PhantomData<*const T>);
    impl<'a, T: InputItem, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
        fn size_hint(&self) -> (usize, Option<usize>) {
            (!0, None)
        }
    }
    pub trait InputItem: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputItem for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.bytes().to_owned()
        }
    }
    macro_rules! from_str_impl {
        { $($T:ty)* } => {
            $(impl InputItem for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().unwrap()
                }
            })*
        }
    }
    from_str_impl! { String char bool f32 f64 }
    macro_rules! parse_int_impl {
        { $($I:ty: $U:ty)* } => {
            $(impl InputItem for $I {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    let f = |s: &[u8]| s.iter().fold(0, |x, b| 10 * x + (b & 0xf) as $I);
                    let s = src.bytes();
                    if let Some((&b'-', t)) = s.split_first() { -f(t) } else { f(s) }
                }
            }
            impl InputItem for $U {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.bytes().iter().fold(0, |x, b| 10 * x + (b & 0xf) as $U)
                }
            })*
        };
    }
    parse_int_impl! { isize:usize i8:u8 i16:u16 i32:u32 i64:u64 i128:u128 }
    macro_rules! tuple_impl {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputItem, $($T: InputItem),*> InputItem for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple_impl!($($T)*);
        };
        () => {}
    }
    tuple_impl!(A B C D E F G);
    macro_rules! array_impl {
        { $($N:literal)* } => {
            $(impl<T: InputItem> InputItem for [T; $N] {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    let mut arr = MaybeUninit::uninit();
                    unsafe {
                        let ptr = arr.as_mut_ptr() as *mut T;
                        for i in 0..$N {
                            ptr.add(i).write(src.input());
                        }
                        arr.assume_init()
                    }
                }
            })*
        };
    }
    array_impl! { 1 2 3 4 5 6 7 8 }
    pub trait Output: Write + Sized {
        fn bytes(&mut self, buf: &[u8]) {
            self.write_all(buf).unwrap();
        }
        fn output<T: OutputItem>(&mut self, x: T) {
            x.output(self);
        }
        fn byte(&mut self, b: u8) {
            self.bytes(slice::from_ref(&b));
        }
        fn ws(&mut self) {
            self.byte(b' ');
        }
        fn ln(&mut self) {
            self.byte(b'\n');
            self.flush_debug();
        }
        fn seq<T: OutputItem, I: IntoIterator<Item = T>>(&mut self, iter: I, delim: u8) {
            let mut first = true;
            for x in iter.into_iter() {
                if !first {
                    self.byte(delim);
                }
                first = false;
                self.output(x);
            }
        }
        fn flush_debug(&mut self) {
            if cfg!(debug_assertions) {
                self.flush().unwrap();
            }
        }
    }
    impl<W: Write + Sized> Output for W {}
    pub trait OutputItem {
        fn output<O: Output>(self, dest: &mut O);
    }
    impl OutputItem for &str {
        fn output<O: Output>(self, dest: &mut O) {
            dest.bytes(self.as_bytes());
        }
    }
    macro_rules! output_int_impl {
        ($conv:ident; $via:ident; $($T:ident)*) => {
            $(impl OutputItem for $T {
                fn output<O: Output>(self, dest: &mut O) {
                    let mut buf = MaybeUninit::<[u8; 20]>::uninit();
                    unsafe {
                        let ptr = buf.as_mut_ptr() as *mut u8;
                        let ofs = $conv(self as $via, ptr, 20);
                        dest.bytes(slice::from_raw_parts(ptr.add(ofs), 20 - ofs));
                    }
                }
            }
            impl OutputItem for &$T {
                fn output<O: Output>(self, dest: &mut O) {
                    (*self).output(dest);
                }
            })*
        };
    }
    output_int_impl!(i64_to_bytes; i64; i8 i16 i32 i64);
    output_int_impl!(u64_to_bytes; u64; u8 u16 u32 u64);
    static DEC_DIGITS_LUT: &[u8; 200] = b"0001020304050607080910111213141516171819\
        2021222324252627282930313233343536373839\
        4041424344454647484950515253545556575859\
        6061626364656667686970717273747576777879\
        8081828384858687888990919293949596979899";
    unsafe fn i64_to_bytes(x: i64, buf: *mut u8, len: usize) -> usize {
        let (neg, x) = if x < 0 { (true, -x) } else { (false, x) };
        let mut i = u64_to_bytes(x as u64, buf, len);
        if neg {
            i -= 1;
            *buf.add(i) = b'-';
        }
        i
    }
    unsafe fn u64_to_bytes(mut x: u64, buf: *mut u8, len: usize) -> usize {
        let lut = DEC_DIGITS_LUT.as_ptr();
        let mut i = len;
        while x >= 10000 {
            let rem = (x % 10000) as usize;
            i -= 4;
            ptr::copy_nonoverlapping(lut.add(2 * (rem / 100)), buf.add(i), 2);
            ptr::copy_nonoverlapping(lut.add(2 * (rem % 100)), buf.add(i + 2), 2);
            x /= 10000;
        }
        let mut x = x as usize;
        if x >= 100 {
            i -= 2;
            ptr::copy_nonoverlapping(lut.add(2 * (x % 100)), buf.add(i), 2);
            x /= 100;
        }
        if x >= 10 {
            i -= 2;
            ptr::copy_nonoverlapping(lut.add(2 * x), buf.add(i), 2);
        } else {
            i -= 1;
            *buf.add(i) = x as u8 + b'0';
        }
        i
    }
    #[macro_export]
    macro_rules! output {
        ($out:expr, $arg:expr) => {
            $out.output($arg);
        };
        ($out:expr, $first:expr, $($rest:expr),*) => {
            $out.output($first);
            $out.ws();
            output!($out, $($rest),*);
        }
    }
    #[macro_export]
    macro_rules! outputln {
        ($out:expr, $($args:expr),*) => {
            output!($out, $($args),*);
            $out.ln();
        }
    }
    #[macro_export]
    macro_rules! kdbg {
        ($($v:expr),*) => {
            if cfg!(debug_assertions) { dbg!($($v),*) } else { ($($v),*) }
        }
    }
}