結果
問題 | No.837 Noelちゃんと星々2 |
ユーザー | koba-e964 |
提出日時 | 2019-06-15 16:38:54 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,825 bytes |
コンパイル時間 | 13,486 ms |
コンパイル使用メモリ | 387,056 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-19 01:12:49 |
合計ジャッジ時間 | 15,685 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 23 ms
6,816 KB |
testcase_01 | AC | 23 ms
6,816 KB |
testcase_02 | AC | 23 ms
6,816 KB |
testcase_03 | AC | 23 ms
6,816 KB |
testcase_04 | AC | 23 ms
6,816 KB |
testcase_05 | AC | 23 ms
6,816 KB |
testcase_06 | AC | 23 ms
6,816 KB |
testcase_07 | AC | 23 ms
6,816 KB |
testcase_08 | AC | 22 ms
6,816 KB |
testcase_09 | AC | 1 ms
6,820 KB |
testcase_10 | AC | 1 ms
6,820 KB |
testcase_11 | AC | 1 ms
6,820 KB |
testcase_12 | AC | 1 ms
6,816 KB |
testcase_13 | AC | 1 ms
6,816 KB |
testcase_14 | AC | 1 ms
6,820 KB |
testcase_15 | AC | 1 ms
6,816 KB |
testcase_16 | AC | 1 ms
6,816 KB |
testcase_17 | AC | 1 ms
6,816 KB |
testcase_18 | AC | 1 ms
6,820 KB |
testcase_19 | AC | 1 ms
6,820 KB |
testcase_20 | AC | 1 ms
6,816 KB |
testcase_21 | AC | 1 ms
6,816 KB |
testcase_22 | AC | 1 ms
6,816 KB |
testcase_23 | AC | 1 ms
6,816 KB |
testcase_24 | AC | 1 ms
6,820 KB |
testcase_25 | AC | 2 ms
6,816 KB |
testcase_26 | WA | - |
testcase_27 | AC | 1 ms
6,820 KB |
testcase_28 | AC | 1 ms
6,816 KB |
testcase_29 | AC | 1 ms
6,820 KB |
testcase_30 | AC | 1 ms
6,816 KB |
testcase_31 | WA | - |
testcase_32 | AC | 1 ms
6,816 KB |
ソースコード
#[allow(unused_imports)] use std::cmp::*; #[allow(unused_imports)] use std::collections::*; use std::io::{Write, BufWriter}; // https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { ($($r:tt)*) => { let stdin = std::io::stdin(); let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock())); let mut next = move || -> String{ bytes .by_ref() .map(|r|r.unwrap() as char) .skip_while(|c|c.is_whitespace()) .take_while(|c|!c.is_whitespace()) .collect() }; 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, [ $t:tt ]) => {{ let len = read_value!($next, usize); (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>() }}; ($next:expr, $t:ty) => { $next().parse::<$t>().expect("Parse error") }; } fn solve() { let out = std::io::stdout(); let mut out = BufWriter::new(out.lock()); macro_rules! puts { ($($format:tt)*) => (write!(out,$($format)*).unwrap()); } input! { n: usize, a: [i64; n], } let mut a = a; a.sort(); let mut acc = vec![0; n + 1]; for i in 0..n { acc[i + 1] = acc[i] + a[i]; } let mut mi = 1 << 50; for i in 0..n + 1 { let mut tot = 0; if i > 0 { let former_med = a[i / 2]; let former = (acc[i / 2] - former_med * (i / 2) as i64) + (former_med * (i - i / 2) as i64 - acc[i] + acc[i / 2]); tot += former; } if i < n { let latter_med = a[i + (n - i) / 2]; let latter = (acc[i + (n - i) / 2] - acc[i] - latter_med * ((n - i) as i64 / 2)) + (latter_med * (n - i - (n - i) / 2) as i64 - acc[n] + acc[i + (n - i) / 2]); tot += latter; } mi = min(mi, -tot); } puts!("{}\n", mi); } fn main() { // In order to avoid potential stack overflow, spawn a new thread. let stack_size = 104_857_600; // 100 MB let thd = std::thread::Builder::new().stack_size(stack_size); thd.spawn(|| solve()).unwrap().join().unwrap(); }