結果
問題 | No.1199 お菓子配り-2 |
ユーザー | hiromi_ayase |
提出日時 | 2020-08-28 22:09:55 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 503 ms / 1,000 ms |
コード長 | 2,873 bytes |
コンパイル時間 | 4,108 ms |
コンパイル使用メモリ | 78,776 KB |
実行使用メモリ | 60,388 KB |
最終ジャッジ日時 | 2023-08-08 22:46:45 |
合計ジャッジ時間 | 24,316 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
50,828 KB |
testcase_01 | AC | 69 ms
50,648 KB |
testcase_02 | AC | 67 ms
50,824 KB |
testcase_03 | AC | 320 ms
58,240 KB |
testcase_04 | AC | 405 ms
59,048 KB |
testcase_05 | AC | 143 ms
54,356 KB |
testcase_06 | AC | 156 ms
56,672 KB |
testcase_07 | AC | 323 ms
58,976 KB |
testcase_08 | AC | 397 ms
58,736 KB |
testcase_09 | AC | 312 ms
57,800 KB |
testcase_10 | AC | 185 ms
56,068 KB |
testcase_11 | AC | 276 ms
57,136 KB |
testcase_12 | AC | 262 ms
57,536 KB |
testcase_13 | AC | 192 ms
56,712 KB |
testcase_14 | AC | 178 ms
58,204 KB |
testcase_15 | AC | 171 ms
56,304 KB |
testcase_16 | AC | 392 ms
58,540 KB |
testcase_17 | AC | 288 ms
57,312 KB |
testcase_18 | AC | 388 ms
59,432 KB |
testcase_19 | AC | 231 ms
56,360 KB |
testcase_20 | AC | 476 ms
60,388 KB |
testcase_21 | AC | 380 ms
57,724 KB |
testcase_22 | AC | 314 ms
57,644 KB |
testcase_23 | AC | 342 ms
58,740 KB |
testcase_24 | AC | 376 ms
57,692 KB |
testcase_25 | AC | 185 ms
56,388 KB |
testcase_26 | AC | 416 ms
58,788 KB |
testcase_27 | AC | 401 ms
58,992 KB |
testcase_28 | AC | 479 ms
59,156 KB |
testcase_29 | AC | 503 ms
59,236 KB |
testcase_30 | AC | 481 ms
58,364 KB |
testcase_31 | AC | 489 ms
59,024 KB |
testcase_32 | AC | 502 ms
59,224 KB |
testcase_33 | AC | 499 ms
58,744 KB |
testcase_34 | AC | 448 ms
57,860 KB |
testcase_35 | AC | 468 ms
58,712 KB |
testcase_36 | AC | 497 ms
58,684 KB |
testcase_37 | AC | 469 ms
58,008 KB |
testcase_38 | AC | 467 ms
58,944 KB |
testcase_39 | AC | 497 ms
57,012 KB |
testcase_40 | AC | 461 ms
58,952 KB |
testcase_41 | AC | 480 ms
58,824 KB |
testcase_42 | AC | 469 ms
58,420 KB |
testcase_43 | AC | 462 ms
58,628 KB |
testcase_44 | AC | 481 ms
59,040 KB |
testcase_45 | AC | 499 ms
58,692 KB |
testcase_46 | AC | 466 ms
58,992 KB |
testcase_47 | AC | 462 ms
58,692 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int m = ni(); long[] a = new long[n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { a[i] += nl(); } } long[] dp = new long[2]; dp[1] = Long.MIN_VALUE / 2; for (int i = 0; i < n; i++) { long x = Math.max(dp[0], dp[1] - a[i]); long y = Math.max(dp[1], dp[0] + a[i]); dp[0] = x; dp[1] = y; } System.out.println(Math.max(dp[0], dp[1])); } 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)); } }