結果
問題 | No.935 う し た ぷ に き あ く ん 笑 ビ - ム |
ユーザー | koba-e964 |
提出日時 | 2020-02-29 00:32:35 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 106 ms / 2,000 ms |
コード長 | 3,654 bytes |
コンパイル時間 | 14,677 ms |
コンパイル使用メモリ | 376,924 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-13 19:36:56 |
合計ジャッジ時間 | 16,622 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
5,248 KB |
testcase_01 | AC | 20 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 24 ms
5,248 KB |
testcase_04 | AC | 28 ms
5,248 KB |
testcase_05 | AC | 4 ms
5,248 KB |
testcase_06 | AC | 46 ms
5,248 KB |
testcase_07 | AC | 42 ms
5,248 KB |
testcase_08 | AC | 104 ms
5,248 KB |
testcase_09 | AC | 62 ms
5,248 KB |
testcase_10 | AC | 74 ms
5,248 KB |
testcase_11 | AC | 101 ms
5,248 KB |
testcase_12 | AC | 1 ms
5,248 KB |
testcase_13 | AC | 1 ms
5,248 KB |
testcase_14 | AC | 1 ms
5,248 KB |
testcase_15 | AC | 1 ms
5,248 KB |
testcase_16 | AC | 1 ms
5,248 KB |
testcase_17 | AC | 106 ms
5,248 KB |
testcase_18 | AC | 22 ms
5,248 KB |
testcase_19 | AC | 58 ms
5,248 KB |
testcase_20 | AC | 44 ms
5,248 KB |
testcase_21 | AC | 5 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 1 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 1 ms
5,248 KB |
testcase_26 | AC | 1 ms
5,248 KB |
testcase_27 | AC | 1 ms
5,248 KB |
testcase_28 | AC | 1 ms
5,248 KB |
testcase_29 | AC | 1 ms
5,248 KB |
testcase_30 | AC | 1 ms
5,248 KB |
testcase_31 | AC | 1 ms
5,248 KB |
testcase_32 | AC | 2 ms
5,248 KB |
testcase_33 | AC | 46 ms
5,248 KB |
testcase_34 | AC | 81 ms
5,248 KB |
testcase_35 | AC | 72 ms
5,248 KB |
testcase_36 | AC | 16 ms
5,248 KB |
testcase_37 | AC | 48 ms
5,248 KB |
testcase_38 | AC | 50 ms
5,248 KB |
testcase_39 | AC | 88 ms
5,248 KB |
testcase_40 | AC | 96 ms
5,248 KB |
testcase_41 | AC | 98 ms
5,248 KB |
testcase_42 | AC | 69 ms
5,248 KB |
testcase_43 | AC | 98 ms
5,248 KB |
testcase_44 | AC | 30 ms
5,248 KB |
testcase_45 | AC | 98 ms
5,248 KB |
testcase_46 | AC | 10 ms
5,248 KB |
testcase_47 | AC | 36 ms
5,248 KB |
testcase_48 | AC | 28 ms
5,248 KB |
testcase_49 | AC | 32 ms
5,248 KB |
testcase_50 | AC | 41 ms
5,248 KB |
testcase_51 | AC | 53 ms
5,248 KB |
testcase_52 | AC | 50 ms
5,248 KB |
testcase_53 | AC | 87 ms
5,248 KB |
testcase_54 | AC | 18 ms
5,248 KB |
testcase_55 | AC | 3 ms
5,248 KB |
testcase_56 | AC | 69 ms
5,248 KB |
testcase_57 | AC | 42 ms
5,248 KB |
testcase_58 | AC | 1 ms
5,248 KB |
testcase_59 | AC | 1 ms
5,248 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, s: chars, a: [i64; n], k: [i64], } let mut acc = vec![0; n + 1]; let mut ss = vec![0; n + 1]; for i in 0..n { acc[i + 1] = acc[i] + a[i]; ss[i + 1] = ss[i] + if s[i] == 'E' { 1 } else { 0 }; } for k in k { let mut ma = 0; for i in 0..n + 1 { let idx = acc[..i].lower_bound(&(acc[i] - k)); ma = max(ma, ss[i] - ss[idx]); let idx = acc[i..].upper_bound(&(acc[i] - k)); ma = max(ma, ss[i + idx] - ss[i]); } puts!("{}\n", ma); } } 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(); }