結果

問題 No.1768 The frog in the well knows the great ocean.
ユーザー hiromi_ayasehiromi_ayase
提出日時 2021-11-27 16:51:59
言語 Java21
(openjdk 21)
結果
AC  
実行時間 989 ms / 3,000 ms
コード長 5,785 bytes
コンパイル時間 2,646 ms
コンパイル使用メモリ 84,028 KB
実行使用メモリ 78,988 KB
最終ジャッジ日時 2024-06-30 07:49:09
合計ジャッジ時間 22,600 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
51,016 KB
testcase_01 AC 187 ms
55,020 KB
testcase_02 AC 185 ms
55,604 KB
testcase_03 AC 182 ms
55,136 KB
testcase_04 AC 182 ms
55,304 KB
testcase_05 AC 190 ms
56,076 KB
testcase_06 AC 752 ms
71,076 KB
testcase_07 AC 803 ms
70,352 KB
testcase_08 AC 722 ms
69,464 KB
testcase_09 AC 725 ms
72,220 KB
testcase_10 AC 734 ms
75,712 KB
testcase_11 AC 874 ms
72,936 KB
testcase_12 AC 827 ms
71,176 KB
testcase_13 AC 817 ms
71,608 KB
testcase_14 AC 856 ms
73,232 KB
testcase_15 AC 804 ms
70,420 KB
testcase_16 AC 989 ms
78,764 KB
testcase_17 AC 944 ms
78,988 KB
testcase_18 AC 989 ms
77,868 KB
testcase_19 AC 874 ms
78,296 KB
testcase_20 AC 980 ms
78,892 KB
testcase_21 AC 78 ms
51,360 KB
testcase_22 AC 80 ms
51,300 KB
testcase_23 AC 149 ms
52,684 KB
testcase_24 AC 721 ms
61,256 KB
testcase_25 AC 758 ms
71,664 KB
testcase_26 AC 907 ms
72,244 KB
testcase_27 AC 78 ms
51,172 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;

class SegmentTreeRMQ {
	public int M, H, N;
	public int[] st;
	
	public SegmentTreeRMQ(int n)
	{
		N = n;
		M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
		H = M>>>1;
		st = new int[M];
		Arrays.fill(st, 0, M, Integer.MAX_VALUE);
	}
	
	public SegmentTreeRMQ(int[] a)
	{
		N = a.length;
		M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
		H = M>>>1;
		st = new int[M];
		for(int i = 0;i < N;i++){
			st[H+i] = a[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)
	{
		st[i] = Math.min(st[2*i], st[2*i+1]);
	}
	
	public int minx(int l, int r){
		int min = Integer.MAX_VALUE;
		if(l >= r)return min;
		while(l != 0){
			int f = l&-l;
			if(l+f > r)break;
			int v = st[(H+l)/f];
			if(v < min)min = v;
			l += f;
		}
		
		while(l < r){
			int f = r&-r;
			int v = st[(H+r)/f-1];
			if(v < min)min = v;
			r -= f;
		}
		return min;
	}
	
	public int min(int l, int r){ return l >= r ? 0 : min(l, r, 0, H, 1);}
	
	private int min(int l, int r, int cl, int cr, int cur)
	{
		if(l <= cl && cr <= r){
			return st[cur];
		}else{
			int mid = cl+cr>>>1;
			int ret = Integer.MAX_VALUE;
			if(cl < r && l < mid){
				ret = Math.min(ret, min(l, r, cl, mid, 2*cur));
			}
			if(mid < r && l < cr){
				ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1));
			}
			return ret;
		}
	}
	
	public int firstle(int l, int v) {
		int cur = H+l;
		while(true){
			if(st[cur] <= v){
				if(cur < H){
					cur = 2*cur;
				}else{
					return cur-H;
				}
			}else{
				cur++;
				if((cur&cur-1) == 0)return -1;
				if((cur&1)==0)cur>>>=1;
			}
		}
	}
	
	public int lastle(int l, int v) {
		int cur = H+l;
		while(true){
			if(st[cur] <= v){
				if(cur < H){
					cur = 2*cur+1;
				}else{
					return cur-H;
				}
			}else{
				if((cur&cur-1) == 0)return -1;
				cur--;
				if((cur&1)==1)cur>>>=1;
			}
		}
	}
}



@SuppressWarnings("unused")
public class Main {

  private static void solve() {
    int t = ni();
    for (int i = 0; i < t; i++) {
      int n = ni();
      int[] a = na(n);
      int[] b = na(n);
      var ret = solve(n, a, b);
      System.out.println(ret ? "Yes" : "No");
    }
  }

  private static boolean solve(int n, int[] a, int[] b) {

    boolean[] can = new boolean[n];

    for (int k = 0; k < 2; k ++) {
      Map<Integer, Integer> map = new HashMap<>();
      int[] left = new int[n];
      for (int i = 0; i < n; i ++) {
        map.put(a[i], i);
        left[i] = map.getOrDefault(b[i], -1);
      }
  
      int[] c = new int[n];
      for(int i = 0; i < n; i ++) {
        c[i] = -a[i];
      }
      var st1 = new SegmentTreeRMQ(b);
      var st2 = new SegmentTreeRMQ(c);
  
      for (int i = 0; i < n; i ++) {
        if (can[i] || left[i] < 0) continue;
        can[i] = st1.min(left[i], i + 1) == b[i] && -st2.min(left[i], i + 1) == b[i];
      }

      // reverse order of arrays
      for (int i = 0, j = n - 1; i < j; i ++, j --) {
        {
          var tmp = a[i];
          a[i] = a[j];
          a[j] = tmp;
        }
        {
          var tmp = b[i];
          b[i] = b[j];
          b[j] = tmp;
        }
        {
          var tmp = can[i];
          can[i] = can[j];
          can[j] = tmp;
        }
      }
    }

    for (var v : can) {
      if (!v) return false;
    }
    return true;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0