結果
問題 | No.1115 二つの数列 / Two Sequences |
ユーザー | hiromi_ayase |
提出日時 | 2020-07-18 02:45:56 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 364 ms / 2,000 ms |
コード長 | 3,325 bytes |
コンパイル時間 | 5,892 ms |
コンパイル使用メモリ | 79,996 KB |
実行使用メモリ | 68,132 KB |
最終ジャッジ日時 | 2023-08-20 16:23:23 |
合計ジャッジ時間 | 14,502 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 136 ms
57,104 KB |
testcase_01 | AC | 62 ms
50,936 KB |
testcase_02 | AC | 61 ms
51,000 KB |
testcase_03 | AC | 333 ms
65,028 KB |
testcase_04 | AC | 364 ms
68,132 KB |
testcase_05 | AC | 326 ms
66,316 KB |
testcase_06 | AC | 329 ms
63,096 KB |
testcase_07 | AC | 335 ms
67,668 KB |
testcase_08 | AC | 124 ms
56,588 KB |
testcase_09 | AC | 256 ms
59,992 KB |
testcase_10 | AC | 323 ms
66,268 KB |
testcase_11 | AC | 66 ms
50,916 KB |
testcase_12 | AC | 356 ms
67,012 KB |
testcase_13 | AC | 352 ms
66,880 KB |
testcase_14 | AC | 358 ms
67,028 KB |
testcase_15 | AC | 61 ms
51,092 KB |
testcase_16 | AC | 58 ms
50,708 KB |
testcase_17 | AC | 57 ms
50,616 KB |
testcase_18 | AC | 58 ms
50,980 KB |
testcase_19 | AC | 63 ms
51,332 KB |
testcase_20 | AC | 59 ms
50,700 KB |
testcase_21 | AC | 57 ms
51,072 KB |
testcase_22 | AC | 57 ms
51,092 KB |
testcase_23 | AC | 137 ms
56,792 KB |
testcase_24 | AC | 242 ms
60,196 KB |
testcase_25 | AC | 330 ms
64,636 KB |
testcase_26 | AC | 167 ms
56,984 KB |
testcase_27 | AC | 244 ms
58,656 KB |
testcase_28 | AC | 277 ms
60,296 KB |
testcase_29 | AC | 305 ms
63,356 KB |
testcase_30 | AC | 347 ms
64,260 KB |
testcase_31 | AC | 205 ms
58,024 KB |
testcase_32 | AC | 164 ms
56,644 KB |
testcase_33 | AC | 317 ms
64,640 KB |
testcase_34 | AC | 58 ms
50,904 KB |
testcase_35 | AC | 57 ms
50,840 KB |
testcase_36 | AC | 58 ms
50,924 KB |
testcase_37 | AC | 58 ms
50,924 KB |
testcase_38 | AC | 57 ms
50,920 KB |
testcase_39 | AC | 57 ms
51,112 KB |
ソースコード
import java.util.Arrays; import java.util.HashMap; import java.util.Map; public class Main { private static void solve() { int n = ni(); int[] a = na(n); int[] b = na(n); Map<Integer, Integer> map = new HashMap<>(); for (int i = 0; i < n; i++) { map.put(b[i], i); } for (int i = 0; i < n; i++) { a[i] = map.get(a[i]); } System.out.println(bubbleCount(a, 0, n)); } public static long bubbleCount(int[] a, int l, int r) { if (r - l <= 1) return 0; int m = (l + r) / 2; long ret = bubbleCount(a, l, m) + bubbleCount(a, m, r); int[] temp = Arrays.copyOfRange(a, l, r); for (int p0 = 0, p1 = m - l, p = l; p < r;) { if (p0 == m - l) { a[p++] = temp[p1++]; } else if (p1 == r - l) { a[p++] = temp[p0++]; } else if (temp[p0] <= temp[p1]) { a[p++] = temp[p0++]; } else { a[p++] = temp[p1++]; ret += m - l - p0; } } return ret; } 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)); } }