結果
問題 | No.838 Noelちゃんと星々3 |
ユーザー | hiromi_ayase |
提出日時 | 2019-06-14 22:54:34 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 315 ms / 2,000 ms |
コード長 | 3,119 bytes |
コンパイル時間 | 3,823 ms |
コンパイル使用メモリ | 87,712 KB |
実行使用メモリ | 60,964 KB |
最終ジャッジ日時 | 2023-08-09 06:27:30 |
合計ジャッジ時間 | 8,008 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 311 ms
60,268 KB |
testcase_01 | AC | 313 ms
59,740 KB |
testcase_02 | AC | 313 ms
60,964 KB |
testcase_03 | AC | 315 ms
59,516 KB |
testcase_04 | AC | 304 ms
59,760 KB |
testcase_05 | AC | 73 ms
50,788 KB |
testcase_06 | AC | 69 ms
50,888 KB |
testcase_07 | AC | 69 ms
50,864 KB |
testcase_08 | AC | 72 ms
51,096 KB |
testcase_09 | AC | 72 ms
50,980 KB |
testcase_10 | AC | 69 ms
50,876 KB |
testcase_11 | AC | 70 ms
51,036 KB |
testcase_12 | AC | 72 ms
52,364 KB |
testcase_13 | AC | 69 ms
50,856 KB |
testcase_14 | AC | 68 ms
51,284 KB |
testcase_15 | AC | 71 ms
51,144 KB |
testcase_16 | AC | 69 ms
50,888 KB |
testcase_17 | AC | 67 ms
50,900 KB |
testcase_18 | AC | 71 ms
51,228 KB |
testcase_19 | AC | 70 ms
50,956 KB |
testcase_20 | AC | 68 ms
51,168 KB |
testcase_21 | AC | 69 ms
51,120 KB |
testcase_22 | AC | 69 ms
51,200 KB |
testcase_23 | AC | 68 ms
51,100 KB |
testcase_24 | AC | 68 ms
50,984 KB |
testcase_25 | AC | 70 ms
50,916 KB |
testcase_26 | AC | 68 ms
50,920 KB |
testcase_27 | AC | 69 ms
51,188 KB |
testcase_28 | AC | 68 ms
50,704 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int[] y = na(n); Arrays.sort(y); //0:isolate 1:same as original 2:same as before long[][] dp = new long[n][3]; for (long[] v : dp) Arrays.fill(v, Long.MAX_VALUE / 10); dp[0][0] = 0; for (int i = 1; i < n; i ++) { dp[i][0] = Math.min(dp[i][0], dp[i - 1][1]); dp[i][0] = Math.min(dp[i][0], dp[i - 1][2]); dp[i][1] = Math.min(dp[i][1], dp[i - 1][0] + Math.abs(y[i] - y[i - 1])); dp[i][2] = Math.min(dp[i][0], dp[i - 1][0] + Math.abs(y[i] - y[i - 1])); dp[i][2] = Math.min(dp[i][1], dp[i - 1][1] + Math.abs(y[i] - y[i - 1])); } System.out.println(Math.min(dp[n - 1][1], dp[n - 1][2])); } 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)); } }