結果
| 問題 | No.972 選び方のスコア |
| ユーザー |
 akiradeveloper
|
| 提出日時 | 2020-01-17 22:54:21 |
| 言語 | Rust (1.77.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 7,293 bytes |
| コンパイル時間 | 2,934 ms |
| コンパイル使用メモリ | 162,132 KB |
| 実行使用メモリ | 15,724 KB |
| 最終ジャッジ日時 | 2023-09-08 06:10:27 |
| 合計ジャッジ時間 | 8,353 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge15 |
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | -- | - |
| testcase_02 | -- | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
コンパイルメッセージ
warning: unused variable: `out`
--> Main.rs:113:13
|
113 | let mut out = BufWriter::new(out.lock());
| ^^^ help: if this is intentional, prefix it with an underscore: `_out`
|
= note: `#[warn(unused_variables)]` on by default
warning: variable does not need to be mutable
--> Main.rs:113:9
|
113 | let mut out = BufWriter::new(out.lock());
| ----^^^
| |
| help: remove this `mut`
|
= note: `#[warn(unused_mut)]` on by default
warning: associated function `add` is never used
--> Main.rs:186:8
|
186 | fn add(&mut self, i: usize, x: i64) {
| ^^^
|
= note: `#[warn(dead_code)]` on by default
warning: variable `L` should have a snake case name
--> Main.rs:135:21
|
135 | let L = (k-1)/2;
| ^ help: convert the identifier to snake case: `l`
|
= note: `#[warn(non_snake_case)]` on by default
warning: variable `R` should have a snake case name
--> Main.rs:136:21
|
136 | let R = (k-1)/2;
| ^ help: convert the identifier to snake case: `r`
warning: variable `L` should have a snake case name
--> Main.rs:151:21
|
151 | let L = (k-2)/2;
| ^ help: convert the identifier to snake case: `l`
warning: variable `R` should have a snake case name
--> Main.rs:152:21
|
152 | let R = (k-2)/2;
| ^ help: convert the identifier to snake case: `r`
warning: 7 warnings emitted
ソースコード
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[macro_export]
macro_rules ! chmax { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: max ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! chmin { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: min ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! max { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: max ( $ x , max ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! min { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: min ( $ x , min ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! dvec { ( $ t : expr ; $ len : expr ) => { vec ! [ $ t ; $ len ] } ; ( $ t : expr ; $ len : expr , $ ( $ rest : expr ) ,* ) => { vec ! [ dvec ! ( $ t ; $ ( $ rest ) ,* ) ; $ len ] } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[macro_export]
macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut parser = Parser :: from_str ( $ s ) ; input_inner ! { parser , $ ( $ r ) * } } ; ( parser = $ parser : ident , $ ( $ r : tt ) * ) => { input_inner ! { $ parser , $ ( $ r ) * } } ; ( new_stdin_parser = $ parser : ident , $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let reader = std :: io :: BufReader :: new ( stdin . lock ( ) ) ; let mut $ parser = Parser :: new ( reader ) ; input_inner ! { $ parser , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { input ! { new_stdin_parser = parser , $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! input_inner { ( $ parser : ident ) => { } ; ( $ parser : ident , ) => { } ; ( $ parser : ident , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ parser , $ t ) ; input_inner ! { $ parser $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! read_value { ( $ parser : ident , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ parser , $ t ) ) ,* ) } ; ( $ parser : ident , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ parser , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ parser : ident , chars ) => { read_value ! ( $ parser , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ parser : ident , usize1 ) => { read_value ! ( $ parser , usize ) - 1 } ; ( $ parser : ident , $ t : ty ) => { $ parser . next ::<$ t > ( ) . expect ( "Parse error" ) } ; }
use std::io;
use std::io::BufRead;
use std::str;
pub struct Parser<R> {
reader: R,
buf: Vec<u8>,
pos: usize,
}
impl Parser<io::Empty> {
pub fn from_str(s: &str) -> Parser<io::Empty> {
Parser {
reader: io::empty(),
buf: s.as_bytes().to_vec(),
pos: 0,
}
}
}
impl<R: BufRead> Parser<R> {
pub fn new(reader: R) -> Parser<R> {
Parser {
reader: reader,
buf: vec![],
pos: 0,
}
}
pub fn update_buf(&mut self) {
self.buf.clear();
self.pos = 0;
loop {
let (len, complete) = {
let buf2 = self.reader.fill_buf().unwrap();
self.buf.extend_from_slice(buf2);
let len = buf2.len();
if len == 0 {
break;
}
(len, buf2[len - 1] <= 0x20)
};
self.reader.consume(len);
if complete {
break;
}
}
}
pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
loop {
let mut begin = self.pos;
while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
begin += 1;
}
let mut end = begin;
while end < self.buf.len() && (self.buf[end] > 0x20) {
end += 1;
}
if begin != self.buf.len() {
self.pos = end;
return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
} else {
self.update_buf();
}
}
}
}
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
use std::thread;
if BIG_STACK_SIZE {
thread::Builder::new()
.stack_size(32 * 1024 * 1024)
.name("solve".into())
.spawn(solve)
.unwrap()
.join()
.unwrap();
} else {
solve();
}
}
// とりあえずN^2解法
fn solve() {
let out = stdout();
let mut out = BufWriter::new(out.lock());
input!{
n:usize,
a:[i64;n]
}
let mut a = a;
a.sort();
let mut cum = CumSum1::new(n);
for i in 0..n {
cum.set(i, a[i]);
}
cum.build();
// kが決まってる時の最適値は計算出来る
// O(N)
let calc = |k: usize| {
if k%2 == 1 {
// 奇数ケース
let mut maxv = 0;
for i in 0..n {
let m = a[i];
let L = (k-1)/2;
let R = (k-1)/2;
if i+R >= n { continue; }
if i<L { continue; } // i-L < 0
let mut v = cum.query(i-L,i) + m + cum.query(n-R,n);
v -= k as i64 * m;
chmax!(maxv, v);
}
maxv
} else {
let mut maxv = 0;
for i in 0..n-1 {
let m0 = a[i];
let m1 = a[i+1];
let L = (k-2)/2;
let R = (k-2)/2;
if i+1+R >= n { continue; }
if i<L { continue; }
let mut v = cum.query(i-L, i) + m0 + m1 + cum.query(n-R, n);
v -= (m0+m1) * k as i64 / 2;
chmax!(maxv, v);
}
maxv
}
};
let mut v = vec![];
for k in 1..n+1 {
v.push(calc(k));
}
let mut maxv = 0;
for x in v {
chmax!(maxv, x);
}
println!("{}",maxv);
}
struct CumSum1 {
base: Vec<i64>,
dp: Vec<i64>,
}
impl CumSum1 {
fn new(n: usize) -> CumSum1 {
CumSum1 {
base: vec![0; n],
dp: vec![],
}
}
fn add(&mut self, i: usize, x: i64) {
self.base[i] += x;
}
fn set(&mut self, i: usize, x: i64) {
self.base[i] = x;
}
fn build(&mut self) {
let n = self.base.len();
let mut dp = vec![0; n + 1];
let mut acc = 0;
for i in 0..n {
acc += self.base[i];
dp[i + 1] = acc;
}
self.dp = dp;
}
#[doc = "[i,j)"]
fn query(&self, i: usize, j: usize) -> i64 {
self.dp[j] - self.dp[i]
}
}