package contest211126; import java.io.*; import java.util.ArrayDeque; import java.util.Arrays; import java.util.InputMismatchException; import java.util.Queue; import java.util.function.IntUnaryOperator; import java.util.function.LongUnaryOperator; /** * 1 6 * 2 1 3 1 3 4 * 3 1 3 4 4 4 */ public class E { InputStream is; FastWriter out; String INPUT = ""; public void solve() { for(int T = ni();T > 0;T--)go(); } SegmentTreeRMQPos sta, stb, stbr; SegmentTreeRMQ stbn; int[] a, b; void go() { int n = ni(); a = na(n); b = na(n); for(int i = 0;i < n;i++){ if(a[i] > b[i]){ out.println("No"); return; } } int[] ib = new int[n]; for(int i = 0;i < n;i++)ib[i] = -b[i]; int[] ibr = new int[n]; for(int i = 0;i < n;i++)ibr[n-1-i] = -b[i]; int[] ia = new int[n]; for(int i = 0;i < n;i++)ia[i] = -a[i]; sta = new SegmentTreeRMQPos(ia); stb = new SegmentTreeRMQPos(ib); stbr = new SegmentTreeRMQPos(ibr); stbn = new SegmentTreeRMQ(b); out.println(dfs(0, n, 0, n) ? "Yes" : "No"); } boolean dfs(int al, int ar, int bl, int br) { // tr(al, ar, bl, br); if(bl == br)return true; if(al == ar)return false; while(al < bl && bl < br){ int[] re = new int[bl-al]; int p = 0; for(int i = bl-1;i >= al;i--){ if(p == 0 || re[p-1] < a[i]){ re[p++] = a[i]; } } al = bl; int sa = 0; for(int d = p-1;d >= 0;d--) { while (bl < br && b[bl] == re[d] && re[d] >= sa) { sa = Math.max(a[bl], sa); bl++; } } } while(ar > br && bl < br){ int[] re = new int[ar-br]; int p = 0; for(int i = br;i < ar;i++){ if(p == 0 || re[p-1] < a[i]){ re[p++] = a[i]; } } ar = br; int sa = 0; for(int d = p-1;d >= 0;d--) { while (bl < br && b[br-1] == re[d] && re[d] >= sa) { sa = Math.max(a[br-1], sa); br--; } } } if(bl == br)return true; if(al == ar)return false; int max = -sta.minx(al, ar); int argmax = sta.minpos; int maxb = -stb.minx(bl, br); // tr(stb.pos); // tr(stb.st); if(maxb != max)return false; int left = stb.minpos; int right = left; while(right < br && b[right] == b[left]){ right++; } return dfs(al, argmax, bl, left) && dfs(argmax+1, ar, right, br); } public static class SegmentTreeRMQ { public final int M, H, N; public int[] vals; public static final int I = Integer.MAX_VALUE; public SegmentTreeRMQ(int n) { N = n; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; vals = new int[M]; Arrays.fill(vals, 0, M, I); } public SegmentTreeRMQ(int[] a) { this(a.length); for(int i = 0;i < N;i++){ vals[H+i] = a[i]; } // Arrays.fill(vals, H+N, M, I); for(int i = H-1;i >= 1;i--)propagate(i); } public void update(int pos, int x) { vals[H+pos] = x; for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i); } private void propagate(int i) { vals[i] = Math.min(vals[2*i], vals[2*i+1]); } public int min(int l, int r){ int min = I; if(l >= r)return min; l += H; r += H; for(;l < r;l>>>=1,r>>>=1){ if((l&1) == 1)min = Math.min(min, vals[l++]); if((r&1) == 1)min = Math.min(min, vals[--r]); } return min; } public int firstle(int l, int v) { if(l >= H)return -1; int cur = H+l; while(true){ if(vals[cur] <= v){ if(cur >= H)return cur-H; cur = 2*cur; }else{ cur++; if((cur&cur-1) == 0)return -1; if((cur&1)==0)cur>>>=1; } } } public int lastle(int l, int v) { if(l < 0)return -1; int cur = H+l; while(true){ if(vals[cur] <= v){ if(cur >= H)return cur-H; cur = 2*cur + 1; }else{ if((cur&cur-1) == 0)return -1; cur--; if((cur&1)==1)cur>>>=1; } } } } public static class SegmentTreeRMQPos { public int M, H, N; public int[] st; public int[] pos; public SegmentTreeRMQPos(int n) { N = n; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; st = new int[M]; pos = new int[M]; for(int i = 0;i < N;i++)pos[H+i] = i; Arrays.fill(st, 0, M, Integer.MAX_VALUE); for(int i = H-1;i >= 1;i--)propagate(i); } public SegmentTreeRMQPos(int[] a) { N = a.length; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; st = new int[M]; pos = new int[M]; for(int i = 0;i < N;i++){ st[H+i] = a[i]; pos[H+i] = i; } Arrays.fill(st, H+N, M, Integer.MAX_VALUE); for(int i = H-1;i >= 1;i--)propagate(i); } public void update(int pos, int x) { st[H+pos] = x; for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i); } private void propagate(int i) { if(st[2*i] <= st[2*i+1]){ st[i] = st[2*i]; pos[i] = pos[2*i]; }else{ st[i] = st[2*i+1]; pos[i] = pos[2*i+1]; } } public int minpos; public int minval; public int minx(int l, int r){ minval = Integer.MAX_VALUE; minpos = -1; if(l >= r)return minval; while(l != 0){ int f = l&-l; if(l+f > r)break; int v = st[(H+l)/f]; if(v < minval || v == minval && pos[(H+l)/f] < minpos){ minval = v; minpos = pos[(H+l)/f]; } l += f; } while(l < r){ int f = r&-r; int v = st[(H+r)/f-1]; if(v < minval || v == minval && pos[(H+r)/f-1] < minpos){ minval = v; minpos = pos[(H+r)/f-1]; } r -= f; } return minval; } public int min(int l, int r){ minpos = -1; minval = Integer.MAX_VALUE; min(l, r, 0, H, 1); return minval; } private void min(int l, int r, int cl, int cr, int cur) { if(l <= cl && cr <= r){ if(st[cur] < minval){ minval = st[cur]; minpos = pos[cur]; } }else{ int mid = cl+cr>>>1; if(cl < r && l < mid)min(l, r, cl, mid, 2*cur); if(mid < r && l < cr)min(l, r, mid, cr, 2*cur+1); } } } public static void main(String[] args) { new E().run(); } public void run() { long S = System.currentTimeMillis(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new FastWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); tr(G-S+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } private boolean eof() { if(lenbuf == -1)return true; int lptr = ptrbuf; while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false; try { is.mark(1000); while(true){ int b = is.read(); if(b == -1){ is.reset(); return true; }else if(!isSpaceChar(b)){ is.reset(); return false; } } } catch (IOException e) { return true; } } private final byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } // private boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } public static class FastWriter { private static final int BUF_SIZE = 1<<13; private final byte[] buf = new byte[BUF_SIZE]; private final OutputStream out; private int ptr = 0; private FastWriter(){out = null;} public FastWriter(OutputStream os) { this.out = os; } public FastWriter(String path) { try { this.out = new FileOutputStream(path); } catch (FileNotFoundException e) { throw new RuntimeException("FastWriter"); } } public FastWriter write(byte b) { buf[ptr++] = b; if(ptr == BUF_SIZE)innerflush(); return this; } public FastWriter write(char c) { return write((byte)c); } public FastWriter write(char[] s) { for(char c : s){ buf[ptr++] = (byte)c; if(ptr == BUF_SIZE)innerflush(); } return this; } public FastWriter write(String s) { s.chars().forEach(c -> { buf[ptr++] = (byte)c; if(ptr == BUF_SIZE)innerflush(); }); return this; } private static int countDigits(int l) { if (l >= 1000000000) return 10; if (l >= 100000000) return 9; if (l >= 10000000) return 8; if (l >= 1000000) return 7; if (l >= 100000) return 6; if (l >= 10000) return 5; if (l >= 1000) return 4; if (l >= 100) return 3; if (l >= 10) return 2; return 1; } public FastWriter write(int x) { if(x == Integer.MIN_VALUE){ return write((long)x); } if(ptr + 12 >= BUF_SIZE)innerflush(); if(x < 0){ write((byte)'-'); x = -x; } int d = countDigits(x); for(int i = ptr + d - 1;i >= ptr;i--){ buf[i] = (byte)('0'+x%10); x /= 10; } ptr += d; return this; } private static int countDigits(long l) { if (l >= 1000000000000000000L) return 19; if (l >= 100000000000000000L) return 18; if (l >= 10000000000000000L) return 17; if (l >= 1000000000000000L) return 16; if (l >= 100000000000000L) return 15; if (l >= 10000000000000L) return 14; if (l >= 1000000000000L) return 13; if (l >= 100000000000L) return 12; if (l >= 10000000000L) return 11; if (l >= 1000000000L) return 10; if (l >= 100000000L) return 9; if (l >= 10000000L) return 8; if (l >= 1000000L) return 7; if (l >= 100000L) return 6; if (l >= 10000L) return 5; if (l >= 1000L) return 4; if (l >= 100L) return 3; if (l >= 10L) return 2; return 1; } public FastWriter write(long x) { if(x == Long.MIN_VALUE){ return write("" + x); } if(ptr + 21 >= BUF_SIZE)innerflush(); if(x < 0){ write((byte)'-'); x = -x; } int d = countDigits(x); for(int i = ptr + d - 1;i >= ptr;i--){ buf[i] = (byte)('0'+x%10); x /= 10; } ptr += d; return this; } public FastWriter write(double x, int precision) { if(x < 0){ write('-'); x = -x; } x += Math.pow(10, -precision)/2; // if(x < 0){ x = 0; } write((long)x).write("."); x -= (long)x; for(int i = 0;i < precision;i++){ x *= 10; write((char)('0'+(int)x)); x -= (int)x; } return this; } public FastWriter writeln(char c){ return write(c).writeln(); } public FastWriter writeln(int x){ return write(x).writeln(); } public FastWriter writeln(long x){ return write(x).writeln(); } public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); } public FastWriter write(int... xs) { boolean first = true; for(int x : xs) { if (!first) write(' '); first = false; write(x); } return this; } public FastWriter write(long... xs) { boolean first = true; for(long x : xs) { if (!first) write(' '); first = false; write(x); } return this; } public FastWriter write(IntUnaryOperator f, int... xs) { boolean first = true; for(int x : xs) { if (!first) write(' '); first = false; write(f.applyAsInt(x)); } return this; } public FastWriter write(LongUnaryOperator f, long... xs) { boolean first = true; for(long x : xs) { if (!first) write(' '); first = false; write(f.applyAsLong(x)); } return this; } public FastWriter writeln() { return write((byte)'\n'); } public FastWriter writeln(int... xs) { return write(xs).writeln(); } public FastWriter writeln(long... xs) { return write(xs).writeln(); } public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); } public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); } public FastWriter writeln(char[] line) { return write(line).writeln(); } public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; } public FastWriter writeln(String s) { return write(s).writeln(); } private void innerflush() { try { out.write(buf, 0, ptr); ptr = 0; } catch (IOException e) { throw new RuntimeException("innerflush"); } } public void flush() { innerflush(); try { out.flush(); } catch (IOException e) { throw new RuntimeException("flush"); } } public FastWriter print(byte b) { return write(b); } public FastWriter print(char c) { return write(c); } public FastWriter print(char[] s) { return write(s); } public FastWriter print(String s) { return write(s); } public FastWriter print(int x) { return write(x); } public FastWriter print(long x) { return write(x); } public FastWriter print(double x, int precision) { return write(x, precision); } public FastWriter println(char c){ return writeln(c); } public FastWriter println(int x){ return writeln(x); } public FastWriter println(long x){ return writeln(x); } public FastWriter println(double x, int precision){ return writeln(x, precision); } public FastWriter print(int... xs) { return write(xs); } public FastWriter print(long... xs) { return write(xs); } public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); } public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); } public FastWriter println(int... xs) { return writeln(xs); } public FastWriter println(long... xs) { return writeln(xs); } public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); } public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); } public FastWriter println(char[] line) { return writeln(line); } public FastWriter println(char[]... map) { return writeln(map); } public FastWriter println(String s) { return writeln(s); } public FastWriter println() { return writeln(); } } public static void trnz(int... o) { for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" "); System.out.println(); } // print ids which are 1 public static void trt(long... o) { Queue stands = new ArrayDeque<>(); for(int i = 0;i < o.length;i++){ for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x)); } System.out.println(stands); } public static void tf(boolean... r) { for(boolean x : r)System.out.print(x?'#':'.'); System.out.println(); } public static void tf(boolean[]... b) { for(boolean[] r : b) { for(boolean x : r)System.out.print(x?'#':'.'); System.out.println(); } System.out.println(); } public void tf(long[]... b) { if(INPUT.length() != 0) { for (long[] r : b) { for (long x : r) { for (int i = 0; i < 64; i++) { System.out.print(x << ~i < 0 ? '#' : '.'); } } System.out.println(); } System.out.println(); } } public void tf(long... b) { if(INPUT.length() != 0) { for (long x : b) { for (int i = 0; i < 64; i++) { System.out.print(x << ~i < 0 ? '#' : '.'); } } System.out.println(); } } private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }