// >>> TEMPLATES #include using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; #define int ll #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep1(i, n) for (int i = 1; i <= (int)(n); i++) #define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i, n) for (int i = (int)(n); i >= 1; i--) #define loop(i, a, B) for (int i = a; i B; i++) #define loopR(i, a, B) for (int i = a; i B; i--) #define all(x) begin(x), end(x) #define allR(x) rbegin(x), rend(x) #define rng(x, l, r) begin(x) + (l), begin(x) + (r) #define pb push_back #define eb emplace_back #define fst first #define snd second template constexpr auto mp(A &&a, B &&b) { return make_pair(forward(a), forward(b)); } template constexpr auto mt(T&&... x) { return make_tuple(forward(x)...); } template auto constexpr inf_ = numeric_limits::max()/2-1; auto constexpr INF32 = inf_; auto constexpr INF64 = inf_; auto constexpr INF = inf_; #ifdef LOCAL #include "debug.hpp" #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template struct pque : priority_queue, Comp> { vector &data() { return this->c; } void clear() { this->c.clear(); } }; template using pque_max = pque>; template using pque_min = pque>; template ::value, int> = 0> ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template ::value, int> = 0> ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template ())), class = typename enable_if::value>::type> istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; } template ostream& operator<<(ostream& os, pair const& p) { return os << p.first << " " << p.second; } template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward(f)) {} template constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward(x)...); } }; struct MakeFixPoint { template constexpr auto operator|(F&& f) const { return FixPoint(forward(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template struct vec_impl { using type = vector::type>; template static type make_v(size_t n, U&&... x) { return type(n, vec_impl::make_v(forward(x)...)); } }; template struct vec_impl { using type = T; static type make_v(T const& x = {}) { return x; } }; template using vec = typename vec_impl::type; template auto make_v(Args&&... args) { return vec_impl::make_v(forward(args)...); } template void quit(T const& x) { cout << x << endl; exit(0); } template constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; } template constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; } template constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits::value_type{}); } template int sz(T const& x) { return x.size(); } template int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); } template int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); } constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; } constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); } constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); } constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 }; constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 }; constexpr int popcnt(ll x) { return __builtin_popcountll(x); } mt19937_64 seed_{random_device{}()}; template Int rand(Int a, Int b) { return uniform_int_distribution(a, b)(seed_); } i64 irand(i64 a, i64 b) { return rand(a, b); } // [a, b] u64 urand(u64 a, u64 b) { return rand(a, b); } // template void shuffle(It l, It r) { shuffle(l, r, seed_); } template V &operator--(V &v) { for (auto &x : v) --x; return v; } template V &operator++(V &v) { for (auto &x : v) ++x; return v; } // <<< // >>> lazy segment tree template struct LazySegtree : Handler { using Value = typename Handler::Value; using Action = typename Handler::Action; using Handler::unit_value; // () -> Value using Handler::unit_action; // () -> Action using Handler::merge; // (Value, Value) -> Value using Handler::compose; // (Action, Action) -> Action using Handler::act; // (Action, Value) -> Value vector v; vector a; int n, lg; LazySegtree() {} template LazySegtree(T&&... x) { init(forward(x)...); } template ()(0))> void init(int n, F gen) { assert(n >= 0); this->n = n; this->lg = (n == 0 ? 0 : __lg(2*n-1)); v.resize(2*n); a.assign(n, unit_action()); for (int i = 0; i < n; i++) v[n+i] = gen(i); for (int i = n-1; i >= 1; i--) v[i] = merge(v[i<<1], v[i<<1|1]); } // void init(int n) { init(n, [&](int) { return unit_value(); }); } void init(int n, Value const& x) { init(n, [&](int) { return x; }); } void init(vector const& v) { init(v.size(), [&](int i) { return v[i]; }); } int size() const { return n; } void act_at(Action const& x, int i) { if (i < n) a[i] = compose(x, a[i]); v[i] = act(x, v[i]); } void flush(int k) { if (n <= k || a[k] == unit_action()) return; act_at(a[k], k<<1); act_at(a[k], k<<1|1); a[k] = unit_action(); } void flush(int l, int r) { for (int p = lg; p; --p) flush(l >> p), flush((r - 1) >> p); } Value get(int l, int r) { assert(0 <= l); assert(l <= r); assert(r <= n); l += n, r += n; flush(l, r); Value x = unit_value(), y = unit_value(); for ( ; l < r; l >>= 1, r >>= 1) { if (l & 1) x = merge(x, v[l++]); if (r & 1) y = merge(v[--r], y); } return merge(x, y); } void build(int i) { i >>= __builtin_ctz(i); while (i >>= 1) v[i] = merge(v[i<<1], v[i<<1|1]); } void apply(int l, int r, Action const& x) { assert(0 <= l); assert(l <= r); assert(r <= n); l += n, r += n; flush(l, r); for (int a = l, b = r; a < b; a >>= 1, b >>= 1) { if (a & 1) act_at(x, a++); if (b & 1) act_at(x, --b); } build(l); build(r); } Value operator[](int i) const { return get(i); } Value get(int i) const { assert(0 <= i); assert(i < n); Value x = v[i += n]; while (i >>= 1) x = act(a[i], x); return x; } void set(int i, Value const& x) { assert(0 <= i); assert(i < n); i += n; for (int p = lg; p; --p) flush(i >> p); v[i] = x; while (i >>= 1) v[i] = merge(v[i<<1], v[i<<1|1]); } template int max_right(int l, F f) { assert(0 <= l); assert(l <= size()); assert(f(unit_value())); l += n; const int r = size() << 1; for (int p = lg; p; p--) flush(l >> p); Value x = unit_value(); while (true) { if (l == r) return size(); int k = __builtin_ctz(l | 1 << __lg(r - l)); auto y = merge(x, v[l >> k]); if (not f(y)) { l >>= k; break; } x = y, l += 1 << k; } while (l < size()) { flush(l); auto y = merge(x, v[l <<= 1]); if (f(y)) x = y, l++; } return l - size(); } template int min_left(int r, F f) { assert(0 <= r); assert(r <= size()); assert(f(unit_value())); r += n; const int l = size(); for (int p = lg; p; p--) flush((r - 1) >> p); Value x = unit_value(); while (true) { if (l == r) return 0; int k = __builtin_ctz(r | 1 << __lg(r - l)); auto y = merge(v[(r >> k) - 1], x); if (not f(y)) { r >>= k; --r; break; } x = y, r -= 1 << k; } while (r < size()) { flush(r); r = r << 1 | 1; auto y = merge(v[r], x); if (f(y)) x = y, r--; } return r + 1 - size(); } vector dat() const { vector ret(size()); for (int i = 0; i < size(); i++) ret[i] = get(i); return ret; } }; template struct Handler { using Value = _Value; using Action = _Action; constexpr static Value unit_value() { return {}; } constexpr static Action unit_action() { return {}; } constexpr static Value merge(Value const& x, Value const& y) { return x * y; } constexpr static Action compose(Action const& x, Action const& y) { return x * y; } constexpr static Value act(Action const& x, Value const& y) { return x(y); } }; // <<< struct MaxChmax { using Value = int; using Action = int; constexpr static Value unit_value() { return -INF; } constexpr static Action unit_action() { return -INF; } constexpr static Value merge(Value const& x, Value const& y) { return max(x, y); } constexpr static Action compose(Action const& x, Action const& y) { return max(x, y); } constexpr static Value act(Action const& x, Value const& y) { return max(x, y); } }; auto solve() { int n; cin >> n; vector a(n), b(n); cin >> a >> b; int now = 0; vector> v; rep (i, n) { int l = now; while (now < n and b[now] == a[i]) now++; int r = now; dump(i, a[i], l, r); if (l < r) { v.eb(a[i], min(l, i), max(r, i+1)); } } sort(all(v)); LazySegtree seg(a); for (auto [x, l, r] : v) { seg.apply(l, r, x); } cout << (now == n && seg.dat() == b ? "Yes" : "No") << '\n'; } int32_t main() { int t; cin >> t; while (t--) { solve(); // cout << (solve() ? "YES" : "NO") << '\n'; debug { cerr << endl; } } }