結果
問題 | No.761 平均値ゲーム |
ユーザー |
|
提出日時 | 2021-11-08 21:40:49 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 26 ms / 2,000 ms |
コード長 | 3,188 bytes |
コンパイル時間 | 12,842 ms |
コンパイル使用メモリ | 380,300 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-16 21:39:25 |
合計ジャッジ時間 | 17,405 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 100 |
ソースコード
#[allow(unused_imports)]use std::cmp::*;// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8macro_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);read_value!($next, [$t; len])}};($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));}trait Bisect<T> {fn lower_bound(&self, val: &T) -> usize;fn upper_bound(&self, val: &T) -> usize;}impl<T: Ord> Bisect<T> for [T] {fn lower_bound(&self, val: &T) -> usize {let mut pass = self.len() + 1;let mut fail = 0;while pass - fail > 1 {let mid = (pass + fail) / 2;if &self[mid - 1] >= val {pass = mid;} else {fail = mid;}}pass - 1}fn upper_bound(&self, val: &T) -> usize {let mut pass = self.len() + 1;let mut fail = 0;while pass - fail > 1 {let mid = (pass + fail) / 2;if &self[mid - 1] > val {pass = mid;} else {fail = mid;}}pass - 1}}trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }impl<T: PartialOrd> Change for T {fn chmax(&mut self, x: T) { if *self < x { *self = x; } }fn chmin(&mut self, x: T) { if *self > x { *self = x; } }}fn main() {// In order to avoid potential stack overflow, spawn a new thread.let stack_size = 104_857_600; // 100 MBlet thd = std::thread::Builder::new().stack_size(stack_size);thd.spawn(|| solve()).unwrap().join().unwrap();}fn calc(a: &[i64], acc: &[i64], l: usize, r: usize) -> bool {if l >= r {return false;}let av = (acc[r] - acc[l] + (r - l) as i64 - 1) / (r - l) as i64;let idx = a[l..r].lower_bound(&av) + l;!(calc(a, acc, l, idx) && calc(a, acc, idx, r))}fn solve() {input! {n: usize,a: [i64; n],}let mut acc = vec![0; n + 1];for i in 0..n {acc[i + 1] = acc[i] + a[i];}println!("{}", if calc(&a, &acc, 0, n) { "First" } else { "Second" });}