#![allow(non_snake_case)] #![allow(unused_imports)] //use itertools::Itertools; //use proconio::input; //use proconio::marker::*; use std::cmp::Reverse; use std::collections::*; fn main() { input! { n:usize, s:chars, t:chars, q:usize, query:[(char,usize1,u8);q], } let mut noteq = BTreeSet::new(); let mut s = s.iter().map(|&si| si as u8 - b'0').collect::>(); let mut t = t.iter().map(|&si| si as u8 - b'0').collect::>(); for i in 0..n { if s[i] != t[i] { noteq.insert(i); } } for (c, x, y) in query { if s[x] == t[x] { if s[x] != y { noteq.insert(x); } } else { if (c == 'S' && y == t[x]) || (c == 'T' && s[x] == y) { noteq.remove(&x); } } if c == 'S' { s[x] = y; } else { t[x] = y; } let f = noteq.first(); let ans = if let Some(&digit) = f { if s[digit] > t[digit] { '>' } else { '<' } } else { '=' }; println!("{}", ans); } } mod input { #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } }