fn run(sc: &mut scanner::Scanner, out: &mut std::io::BufWriter) { let t: u32 = sc.next(); for _ in 0..t { let n: usize = sc.next(); let m: usize = sc.next(); let mut p = vec![(0, 0); m]; for p in p.iter_mut() { p.0 = sc.next::(); } for p in p.iter_mut() { p.1 = sc.next::(); } p.sort_by_key(|p| (p.1, p.0)); writeln!(out, "{}", if solve(p, 1, n) {"Yes"} else {"No"}).ok(); } } fn solve(mut p: Vec<(usize, usize)>, l: usize, r: usize) -> bool { if p.is_empty() { return true; } if let Some(x) = p.windows(2).rposition(|p| p[0].1 == p[1].1) { let v = p[x].1; let mut po = x; while po > 0 && p[po - 1].1 == v { po -= 1; } if p[po..x + 2].iter().any(|p| p.0 != v) { return false; } let t = p.split_off(x + 2); p.truncate(po); return solve(p, l, v - 1) && solve(t, v + 1, r); } p.iter().all(|p| l <= p.0 && p.0 <= r) && p.windows(2).all(|p| p[0].0 <= p[1].0) } /* 順序は保つ サンプル2が不可能? 区別するのか 操作で合流させることは不可能 合流しているものについては個別に判定 重なっていない時どうか WA */ // ---------- begin scannner ---------- #[allow(dead_code)] mod scanner { use std::str::FromStr; pub struct Scanner<'a> { it: std::str::SplitWhitespace<'a>, } impl<'a> Scanner<'a> { pub fn new(s: &'a String) -> Scanner<'a> { Scanner { it: s.split_whitespace(), } } pub fn next(&mut self) -> T { self.it.next().unwrap().parse::().ok().unwrap() } pub fn next_bytes(&mut self) -> Vec { self.it.next().unwrap().bytes().collect() } pub fn next_chars(&mut self) -> Vec { self.it.next().unwrap().chars().collect() } pub fn next_vec(&mut self, len: usize) -> Vec { (0..len).map(|_| self.next()).collect() } } } // ---------- end scannner ---------- use std::io::Write; use std::collections::*; type Map = BTreeMap; type Set = BTreeSet; type Deque = VecDeque; fn main() { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); let mut sc = scanner::Scanner::new(&s); let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); run(&mut sc, &mut out); }