aboutsummaryrefslogtreecommitdiff
path: root/codeforces/YetAnotherBrokenKeoard/main.rs
blob: e39fbd559237f8530552aef0463f0a50dc7a66c7 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

fn solve() {
    let inp = read::<String>();
    let s = inp.as_bytes();
    let mut marks = vec![true; s.len()];
    let mut rmost_l = vec![s.iter().position(|&x| x.is_ascii_lowercase()).unwrap_or(0)];
    let mut rmost_h = vec![s.iter().position(|&x| x.is_ascii_uppercase()).unwrap_or(0)];
    for (i, &c) in s.iter().enumerate() {
        match c as char {
            'b' => {
                marks[i] = false;
                marks[rmost_l.pop().unwrap_or(i)] = false;
            }
            'B' => {
                marks[i] = false;
                marks[rmost_h.pop().unwrap_or(i)] = false;
            }
            _ => {}
        };
        if c.is_ascii_uppercase() && c != 'B' as u8 {
            rmost_h.push(i);
        } else if c.is_ascii_lowercase() && c != 'b' as u8 {
            rmost_l.push(i);
        }
    }
    let ans = s
        .iter()
        .zip(marks.iter())
        .filter_map(|(&x, include)| include.then_some(x as char))
        .collect::<String>();
    println!("{}", ans)
}

fn main() {
    let mut tt = read::<u64>();
    while tt > 0 {
        solve();
        tt -= 1;
    }
}