// Original: https://github.com/tanakh/competitive-rs #[allow(unused_macros)] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); let mut next = || { iter.next().unwrap() }; input_inner!{next, $($r)*} }; ($($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)*} }; } #[allow(unused_macros)] 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)*} }; ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => { let mut $var = read_value!($next, $t); input_inner!{$next $($r)*} }; } #[allow(unused_macros)] 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::>() }; ($next:expr, [ $t:tt ]) => { { let len = read_value!($next, usize); (0..len).map(|_| read_value!($next, $t)).collect::>() } }; ($next:expr, chars) => { read_value!($next, String).chars().collect::>() }; ($next:expr, bytes) => { read_value!($next, String).into_bytes() }; ($next:expr, usize1) => { read_value!($next, usize) - 1 }; ($next:expr, $t:ty) => { $next().parse::<$t>().expect("Parse error") }; } mod util { #[allow(dead_code)] pub fn chmin(x: &mut T, y: T) -> bool where T: PartialOrd + Copy, { *x > y && { *x = y; true } } #[allow(dead_code)] pub fn chmax(x: &mut T, y: T) -> bool where T: PartialOrd + Copy, { *x < y && { *x = y; true } } /// 整数除算切り上げ #[allow(dead_code)] pub fn roundup(a: i64, b: i64) -> i64 { (a + b - 1) / b } #[allow(dead_code)] pub fn ctoi(c: char) -> i64 { c as i64 - 48 } } #[allow(unused_imports)] use util::*; #[allow(unused_imports)] use std::cmp::{max, min}; #[allow(unused_imports)] use std::collections::{BTreeMap, BTreeSet, BinaryHeap, VecDeque}; fn main() { input! { n:usize, s:chars, ass:[i64;n], q:usize, ks:[i64;q] } let mut enemies = vec![0; n + 1]; let mut hps = vec![0; n + 1]; for i in 0..n { let c = if s[i] == 'E' { 1 } else { 0 }; enemies[i + 1] = enemies[i] + c; hps[i + 1] = hps[i] + ass[i]; } for i in 0..q { let k = ks[i]; let mut ok = 0; let mut ng = hps.len() as i64; while (ok - ng).abs() > 1 { let mid = (ok + ng) / 2; if hps[mid as usize] <= k { ok = mid; } else { ng = mid; } } println!("{}", enemies[ok as usize]); } }