結果

問題 No.973 余興
ユーザー koba-e964koba-e964
提出日時 2020-02-28 00:26:20
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 1,313 ms / 4,000 ms
コード長 4,058 bytes
コンパイル時間 12,737 ms
コンパイル使用メモリ 380,980 KB
実行使用メモリ 26,752 KB
最終ジャッジ日時 2024-10-13 16:10:10
合計ジャッジ時間 41,636 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,310 ms
26,624 KB
testcase_01 AC 1,300 ms
26,624 KB
testcase_02 AC 1,304 ms
26,752 KB
testcase_03 AC 1,289 ms
26,624 KB
testcase_04 AC 1,281 ms
26,624 KB
testcase_05 AC 1,289 ms
26,624 KB
testcase_06 AC 1,294 ms
26,624 KB
testcase_07 AC 1,294 ms
26,624 KB
testcase_08 AC 1,313 ms
26,624 KB
testcase_09 AC 1,311 ms
26,624 KB
testcase_10 AC 1,239 ms
25,600 KB
testcase_11 AC 251 ms
10,880 KB
testcase_12 AC 251 ms
11,008 KB
testcase_13 AC 256 ms
10,880 KB
testcase_14 AC 242 ms
11,008 KB
testcase_15 AC 46 ms
6,816 KB
testcase_16 AC 48 ms
6,820 KB
testcase_17 AC 30 ms
6,816 KB
testcase_18 AC 38 ms
6,816 KB
testcase_19 AC 38 ms
6,820 KB
testcase_20 AC 29 ms
6,816 KB
testcase_21 AC 48 ms
6,816 KB
testcase_22 AC 49 ms
6,816 KB
testcase_23 AC 39 ms
6,816 KB
testcase_24 AC 39 ms
6,816 KB
testcase_25 AC 17 ms
6,816 KB
testcase_26 AC 29 ms
6,820 KB
testcase_27 AC 56 ms
6,816 KB
testcase_28 AC 39 ms
6,816 KB
testcase_29 AC 41 ms
6,816 KB
testcase_30 AC 664 ms
26,752 KB
testcase_31 AC 659 ms
26,624 KB
testcase_32 AC 667 ms
26,752 KB
testcase_33 AC 688 ms
26,752 KB
testcase_34 AC 671 ms
26,496 KB
testcase_35 AC 674 ms
26,752 KB
testcase_36 AC 649 ms
26,112 KB
testcase_37 AC 642 ms
25,984 KB
testcase_38 AC 672 ms
26,624 KB
testcase_39 AC 670 ms
26,624 KB
testcase_40 AC 1 ms
6,820 KB
testcase_41 AC 1 ms
6,816 KB
testcase_42 AC 1 ms
6,816 KB
testcase_43 AC 1 ms
6,820 KB
testcase_44 AC 1 ms
6,820 KB
testcase_45 AC 2 ms
6,816 KB
testcase_46 AC 276 ms
26,624 KB
testcase_47 AC 288 ms
26,752 KB
testcase_48 AC 303 ms
26,752 KB
testcase_49 AC 256 ms
24,832 KB
testcase_50 AC 299 ms
26,496 KB
testcase_51 AC 278 ms
26,624 KB
testcase_52 AC 788 ms
26,752 KB
testcase_53 AC 777 ms
26,240 KB
testcase_54 AC 778 ms
26,752 KB
testcase_55 AC 779 ms
26,624 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[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")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

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
    }
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input! {
        n: usize, x: i64,
        a: [i64; n],
    }
    let mut acc = vec![0; n + 1];
    for i in 0..n {
        acc[i + 1] = acc[i] + a[i];
    }
    let mut dp = vec![vec![false; n + 1]; n];
    let mut zero_l = vec![0; n];
    let mut zero_r = vec![n + 1; n + 1];
    for i in 0..n {
        zero_l[i] = i + 1;
        zero_r[i + 1] = i;
    }
    for s in 2..=n {
        for i in 0..n + 1 - s {
            let j = i + s;
            let mut win = false;
            let k = min(j - 1, acc.upper_bound(&(acc[i] + x)) - 1);
            if zero_r[j] <= k {
                win = true;
            }
            if !win {
                let k = max(i + 1, acc.lower_bound(&(acc[j] - x)));
                if zero_l[i] >= k {
                    win = true;
                }
            }
            dp[i][j] = win;
            if !win {
                zero_l[i] = j;
                zero_r[j] = i;
            }
        }
    }
    puts!("{}\n", if zero_l[0] != n { "A" } else { "B" });
}

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();
}
0