結果
問題 | No.1597 Matrix Sort |
ユーザー | hiromi_ayase |
提出日時 | 2021-07-10 02:13:20 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 920 ms / 1,500 ms |
コード長 | 3,203 bytes |
コンパイル時間 | 3,802 ms |
コンパイル使用メモリ | 84,216 KB |
実行使用メモリ | 63,100 KB |
最終ジャッジ日時 | 2023-09-14 13:49:16 |
合計ジャッジ時間 | 23,411 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
50,976 KB |
testcase_01 | AC | 70 ms
50,836 KB |
testcase_02 | AC | 70 ms
50,800 KB |
testcase_03 | AC | 876 ms
60,760 KB |
testcase_04 | AC | 853 ms
60,732 KB |
testcase_05 | AC | 844 ms
60,792 KB |
testcase_06 | AC | 816 ms
60,272 KB |
testcase_07 | AC | 833 ms
61,404 KB |
testcase_08 | AC | 809 ms
61,068 KB |
testcase_09 | AC | 758 ms
61,408 KB |
testcase_10 | AC | 613 ms
57,524 KB |
testcase_11 | AC | 920 ms
61,348 KB |
testcase_12 | AC | 697 ms
60,112 KB |
testcase_13 | AC | 878 ms
61,468 KB |
testcase_14 | AC | 845 ms
62,036 KB |
testcase_15 | AC | 619 ms
60,620 KB |
testcase_16 | AC | 711 ms
60,760 KB |
testcase_17 | AC | 677 ms
60,204 KB |
testcase_18 | AC | 853 ms
61,240 KB |
testcase_19 | AC | 769 ms
61,624 KB |
testcase_20 | AC | 698 ms
61,200 KB |
testcase_21 | AC | 643 ms
60,408 KB |
testcase_22 | AC | 639 ms
63,100 KB |
testcase_23 | AC | 657 ms
61,300 KB |
testcase_24 | AC | 606 ms
59,008 KB |
testcase_25 | AC | 579 ms
57,748 KB |
testcase_26 | AC | 69 ms
51,348 KB |
testcase_27 | AC | 70 ms
48,752 KB |
testcase_28 | AC | 69 ms
50,848 KB |
testcase_29 | AC | 71 ms
51,164 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); long k = nl(); int p = ni(); int[] a = na(n); int[] b = na(n); Arrays.sort(a); Arrays.sort(b); int ng = -1; int ok = Integer.MAX_VALUE / 2; while (Math.abs(ok - ng) > 1) { int v = (ok + ng) / 2; // v未満の数 long cnt = 0; for (int ca : a) { cnt += lowerBound(b, v - ca) + (lowerBound(b, p + v - ca) - lowerBound(b, p - ca)); } if (cnt >= k) { ok = v; } else { ng = v; } } System.out.println(ok - 1); } public static int lowerBound(int[] a, int v) { int low = -1, high = a.length; while(high-low > 1){ int h = high+low>>>1; if(a[h] >= v){ high = h; }else{ low = h; } } return high; } 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)); } }