#435342 (Rust) No.973 余興

• 問題: No.973 余興
• ユーザー: koba-e964
• 提出日時: 2020-02-28 00:16:31
• 言語: Rust (1.77.0 + proconio)
• 結果: WA
• 実行時間: -
• コード長: 4,048 bytes
• コンパイル時間: 11,582 ms
• コンパイル使用メモリ: 393,136 KB
• 実行使用メモリ: 26,880 KB
• 最終ジャッジ日時: 2024-10-13 16:08:27
• 合計ジャッジ時間: 42,319 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1,101 ms; 26,752 KB
testcase_01	AC	1,101 ms; 26,624 KB
testcase_02	AC	1,104 ms; 26,624 KB
testcase_03	AC	1,105 ms; 26,624 KB
testcase_04	AC	1,105 ms; 26,624 KB
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	AC	1,044 ms; 25,600 KB
testcase_11	AC	312 ms; 10,880 KB
testcase_12	AC	282 ms; 10,880 KB
testcase_13	WA	-
testcase_14	AC	309 ms; 10,880 KB
testcase_15	WA	-
testcase_16	WA	-
testcase_17	AC	23 ms; 5,248 KB
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	AC	39 ms; 5,248 KB
testcase_23	AC	31 ms; 5,248 KB
testcase_24	AC	32 ms; 5,248 KB
testcase_25	AC	13 ms; 5,248 KB
testcase_26	AC	23 ms; 5,248 KB
testcase_27	AC	48 ms; 5,248 KB
testcase_28	WA	-
testcase_29	AC	31 ms; 5,248 KB
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	AC	897 ms; 26,624 KB
testcase_35	AC	897 ms; 26,880 KB
testcase_36	WA	-
testcase_37	WA	-
testcase_38	AC	866 ms; 26,752 KB
testcase_39	WA	-
testcase_40	AC	1 ms; 5,248 KB
testcase_41	AC	1 ms; 5,248 KB
testcase_42	AC	1 ms; 5,248 KB
testcase_43	WA	-
testcase_44	AC	1 ms; 5,248 KB
testcase_45	WA	-
testcase_46	AC	382 ms; 26,752 KB
testcase_47	WA	-
testcase_48	AC	395 ms; 26,624 KB
testcase_49	WA	-
testcase_50	AC	387 ms; 26,496 KB
testcase_51	WA	-
testcase_52	WA	-
testcase_53	AC	984 ms; 26,240 KB
testcase_54	AC	1,090 ms; 26,752 KB
testcase_55	AC	927 ms; 26,752 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")
    };
}

#[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)));
            if zero_l[i] >= k {
                win = true;
            }
            if !win {
                let k = max(i + 1, acc.lower_bound(&(acc[j] - x)));
                if zero_r[j] <= k {
                    win = true;
                }
            }
            dp[i][j] = win;
            if !win {
                zero_l[i] = j;
                zero_r[j] = i;
            }
        }
    }
    puts!("{}\n", if dp[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();
}