結果
| 問題 | No.972 選び方のスコア |
| ユーザー |
 bqn
|
| 提出日時 | 2022-06-10 19:07:17 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,756 bytes |
| コンパイル時間 | 11,801 ms |
| コンパイル使用メモリ | 378,188 KB |
| 実行使用メモリ | 8,480 KB |
| 最終ジャッジ日時 | 2024-09-21 05:48:58 |
| 合計ジャッジ時間 | 16,323 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 8 WA * 24 |
コンパイルメッセージ
warning: unused macro definition: `input_inner`
--> src/main.rs:89:14
|
89 | macro_rules! input_inner {
| ^^^^^^^^^^^
|
= note: `#[warn(unused_macros)]` on by default
ソースコード
#![allow(unused_parens)]#![allow(unused_imports)]#![allow(non_upper_case_globals)]#![allow(non_snake_case)]#![allow(unused_mut)]#![allow(unused_variables)]#![allow(dead_code)]type Vec2<T> = Vec<Vec<T>>;type Vec3<T> = Vec<Vec<Vec<T>>>;#[allow(unused_macros)]macro_rules! invec {( $ t : ty ) => {{let mut s = String::new();match std::io::stdin().read_line(&mut s) {Ok(0) => Vec::<$t>::new(),Ok(n) => s.trim().split_whitespace().map(|s| s.parse::<$t>().unwrap()).collect::<Vec<$t>>(),Err(_) => Vec::<$t>::new(),}}};}#[allow(unused_macros)]macro_rules! get {($t:ty) => {{let mut line: String = String::new();std::io::stdin().read_line(&mut line).unwrap();line.trim().parse::<$t>().unwrap()}};($($t:ty),*) => {{let mut line: String = String::new();std::io::stdin().read_line(&mut line).unwrap();let mut iter = line.split_whitespace();($(iter.next().unwrap().parse::<$t>().unwrap(),)*)}};($t:ty; $n:expr) => {(0..$n).map(|_|get!($t)).collect::<Vec<_>>()};($($t:ty),*; $n:expr) => {(0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()};($t:ty ;;) => {{let mut line: String = String::new();std::io::stdin().read_line(&mut line).unwrap();line.split_whitespace().map(|t| t.parse::<$t>().unwrap()).collect::<Vec<_>>()}};($t:ty ;; $n:expr) => {(0..$n).map(|_| get!($t ;;)).collect::<Vec<_>>()};}#[allow(unused_macros)]macro_rules! input {(source = $s:expr, $($r:tt)*) => {let mut iter = $s.split_whitespace();input_inner!{iter, $($r)*}};($($r:tt)*) => {let mut s = {use std::io::Read;let mut s = String::new();std::io::stdin().read_to_string(&mut s).unwrap();s};let mut iter = s.split_whitespace();input_inner!{iter, $($r)*}};}macro_rules! input_inner {($iter:expr) => {};($iter:expr, ) => {};($iter:expr, $var:ident : $t:tt $($r:tt)*) => {let $var = read_value!($iter, $t);input_inner!{$iter $($r)*}};($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {let mut $var = read_value!($iter, $t);input_inner!{$iter $($r)*}};}#[allow(unused_macros)]macro_rules! read_value {($iter:expr, ( $($t:tt),* )) => {( $(read_value!($iter, $t)),* )};($iter:expr, [ $t:tt ; $len:expr ]) => {(0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()};($next:expr, [$t:tt]) => {{let len = read_value!($next, usize);(0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()}};($iter:expr, chars) => {read_value!($iter, String).chars().collect::<Vec<char>>()};($iter:expr, usize1) => {read_value!($iter, usize) - 1};($iter:expr, $t:ty) => {$iter.next().unwrap().parse::<$t>().expect("Parse error")};}#[allow(unused_macros)]#[cfg(debug_assertions)]macro_rules! mydbg {//($arg:expr) => (dbg!($arg))//($arg:expr) => (println!("{:?}",$arg));($($a:expr),*) => {eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);}}#[cfg(not(debug_assertions))]macro_rules! mydbg {($($arg:expr),*) => {};}macro_rules! echo {($($a:expr),*) => {$(println!("{}",$a))*}}use std::cmp::*;use std::collections::*;use std::ops::{Add, Div, Mul, Rem, Sub};trait SafeRangeContain {fn safe_contains(&self, x: i64) -> bool;}impl SafeRangeContain for std::ops::Range<usize> {fn safe_contains(&self, x: i64) -> bool {if x < 0 {return false;}return self.contains(&(x as usize));}}#[allow(dead_code)]static INF_I64: i64 = i64::max_value() / 2;#[allow(dead_code)]static INF_I32: i32 = i32::max_value() / 2;#[allow(dead_code)]static INF_USIZE: usize = usize::max_value() / 2;#[allow(dead_code)]static M_O_D: usize = 1000000007;#[allow(dead_code)]static PAI: f64 = 3.1415926535897932;trait IteratorExt: Iterator {fn toVec(self) -> Vec<Self::Item>;}impl<T: Iterator> IteratorExt for T {fn toVec(self) -> Vec<Self::Item> {self.collect()}}trait CharExt {fn toNum(&self) -> usize;fn toAlphabetIndex(&self) -> usize;fn toNumIndex(&self) -> usize;}impl CharExt for char {fn toNum(&self) -> usize {return *self as usize;}fn toAlphabetIndex(&self) -> usize {return self.toNum() - 'a' as usize;}fn toNumIndex(&self) -> usize {return self.toNum() - '0' as usize;}}trait VectorExt {fn joinToString(&self, s: &str) -> String;}impl<T: ToString> VectorExt for Vec<T> {fn joinToString(&self, s: &str) -> String {return self.iter().map(|x| x.to_string()).collect::<Vec<_>>().join(s);}}trait StringExt {fn get_reverse(&self) -> String;}impl StringExt for String {fn get_reverse(&self) -> String {self.chars().rev().collect::<String>()}}trait UsizeExt {fn pow(&self, n: usize) -> usize;}impl UsizeExt for usize {fn pow(&self, n: usize) -> usize {return ((*self as u64).pow(n as u32)) as usize;}}fn main() {solve();}fn solve() {let mut ans = 0;let N = get!(usize);let mut A = invec!(i64);A.sort();let mut s = vec![0; N + 1];for i in 0..N {s[i + 1] = s[i] + A[i];}let mut b = vec![];for i in 0..N {b.push(s[N] - s[N - i - 1] + s[i + 1]);}mydbg!(s, b);for i in 1..N - 1 {let k = min(i - 1, N - i - 1);let mut l = 0;let mut r = k + 1;for _ in 0..60 {let m1 = (l * 2 + r) / 3;let m2 = (l + r * 2) / 3;if f(&b, A[i], m1) < f(&b, A[i], m2) {r = m2;} else {l = m1;}}for j in l.saturating_sub(3)..=r + 3 {if j > k {continue;}ans = max(ans, f(&b, A[i], j));}}echo!(ans);}fn f(s: &[i64], a: i64, m1: usize) -> i64 {s[m1] - a * 2 * (m1 + 1) as i64}