結果

問題 No.670 log は定数
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-03-24 05:38:09
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,072 ms / 4,000 ms
コード長 3,938 bytes
コンパイル時間 3,964 ms
コンパイル使用メモリ 82,344 KB
実行使用メモリ 45,480 KB
最終ジャッジ日時 2024-06-25 02:42:08
合計ジャッジ時間 26,044 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,049 ms
45,204 KB
testcase_01 AC 1,822 ms
44,656 KB
testcase_02 AC 1,964 ms
45,184 KB
testcase_03 AC 1,807 ms
45,148 KB
testcase_04 AC 1,755 ms
45,452 KB
testcase_05 AC 2,015 ms
45,216 KB
testcase_06 AC 1,780 ms
45,480 KB
testcase_07 AC 1,948 ms
45,060 KB
testcase_08 AC 2,072 ms
45,152 KB
testcase_09 AC 1,830 ms
45,340 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;

public class Main {
  private static void solve() {
    int n = ni();
    int q = ni();
    seed = nl();
    for (int i = 0; i < 10000; i++)
      nx();

    int[] a = new int[n];
    for (int i = 0; i < n; i++) {
      a[i] = nx();
    }
    Arrays.sort(a);

    int bsize = 16;
    int s1 = 1 << bsize;
    int s2 = 31 - bsize;
    int[] count = new int[s1 + 1];
    for (int v : a) {
      count[(v >> s2) + 1]++;
    }
    int[][] b = new int[s1][];
    int ptr = 0;
    for (int i = 0; i < s1; i++) {
      b[i] = new int[count[i + 1]];
      int j = 0;
      while (ptr < n && (a[ptr] >> s2) <= i) {
        b[i][j++] = a[ptr++];
      }
    }
    for (int i = 1; i < s1; i++) {
      count[i] += count[i - 1];
    }

    long ret = 0;

    for (int i = 0; i < q; i++) {
      int p = nx();
      int r = p >> s2;

      long x = count[r];
      for (int v : b[r]) {
        if (v < p) {
          x++;
        } else {
          break;
        }
      }
      ret ^= x * i;
    }
    System.out.println(ret);
  }

  public static int lowerBound(int[] a, int l, int r, int v) {
    if (l > r || l < 0 || r > a.length)
      throw new IllegalArgumentException();
    int low = l - 1, high = r;
    while (high - low > 1) {
      int h = high + low >>> 1;
      if (a[h] >= v) {
        high = h;
      } else {
        low = h;
      }
    }
    return high;
  }

  static long seed;

  static int nx() {
    long now = seed;
    now = now ^ (now << 13);
    now = now ^ (now >>> 7);
    now = now ^ (now << 17);
    seed = now;
    return (int) (now >>> 33);
  }

  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