結果
問題 | No.45 回転寿司 |
ユーザー | tutuz |
提出日時 | 2018-09-22 08:36:26 |
言語 | Java21 (openjdk 21) |
結果 |
MLE
|
実行時間 | - |
コード長 | 3,310 bytes |
コンパイル時間 | 2,365 ms |
コンパイル使用メモリ | 74,628 KB |
実行使用メモリ | 741,156 KB |
最終ジャッジ日時 | 2023-09-25 10:57:16 |
合計ジャッジ時間 | 21,091 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 472 ms
386,528 KB |
testcase_01 | MLE | - |
testcase_02 | MLE | - |
testcase_03 | MLE | - |
testcase_04 | MLE | - |
testcase_05 | AC | 155 ms
163,028 KB |
testcase_06 | MLE | - |
testcase_07 | MLE | - |
testcase_08 | AC | 272 ms
301,480 KB |
testcase_09 | MLE | - |
testcase_10 | AC | 390 ms
401,816 KB |
testcase_11 | AC | 264 ms
301,728 KB |
testcase_12 | MLE | - |
testcase_13 | AC | 157 ms
163,092 KB |
testcase_14 | AC | 131 ms
115,152 KB |
testcase_15 | AC | 420 ms
433,896 KB |
testcase_16 | AC | 359 ms
379,116 KB |
testcase_17 | AC | 393 ms
383,956 KB |
testcase_18 | AC | 347 ms
379,792 KB |
testcase_19 | MLE | - |
testcase_20 | AC | 126 ms
115,600 KB |
testcase_21 | AC | 149 ms
163,532 KB |
testcase_22 | AC | 80 ms
61,936 KB |
testcase_23 | AC | 80 ms
62,052 KB |
testcase_24 | AC | 70 ms
59,800 KB |
testcase_25 | AC | 76 ms
59,024 KB |
testcase_26 | AC | 409 ms
425,388 KB |
testcase_27 | MLE | - |
testcase_28 | MLE | - |
testcase_29 | MLE | - |
testcase_30 | MLE | - |
testcase_31 | AC | 81 ms
61,864 KB |
testcase_32 | AC | 76 ms
59,036 KB |
testcase_33 | MLE | - |
ソースコード
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.OutputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskX solver = new TaskX(); solver.solve(1, in, out); out.close(); } static int INF = 1 << 30; static long LINF = 1L << 55; static int MOD = 1000000007; static int[] mh4 = { 0, -1, 1, 0 }; static int[] mw4 = { -1, 0, 0, 1 }; static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 }; static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 }; static class TaskX { int n; int[] a; int ans; int[][] memo; public void solve(int testNumber, InputReader in, PrintWriter out) { n = in.nextInt(); a = in.nextIntArray(n); memo = new int[n+10][200000]; fill(memo, -1); f(0, 0); out.println(ans); } int f(int now, int v) { if (now >= n) { ans = Math.max(ans, v); return ans; } if (memo[now][v] != -1) { return memo[now][v]; } return memo[now][v] = Math.max(f(now + 1, v), f(now + 2, v + a[now])); } } static void fill(int[][] memo, int v) { for (int i = 0; i < memo.length; i++) { Arrays.fill(memo[i], v); } } static class InputReader { BufferedReader in; StringTokenizer tok; public String nextString() { while (!tok.hasMoreTokens()) { try { tok = new StringTokenizer(in.readLine(), " "); } catch (IOException e) { throw new InputMismatchException(); } } return tok.nextToken(); } public int nextInt() { return Integer.parseInt(nextString()); } public long nextLong() { return Long.parseLong(nextString()); } public double nextDouble() { return Double.parseDouble(nextString()); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public int[] nextIntArray1Index(int n) { int[] res = new int[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextInt(); } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public long[] nextLongArray1Index(int n) { long[] res = new long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } public double[] nextDoubleArray(int n) { double[] res = new double[n]; for (int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } public InputReader(InputStream inputStream) { in = new BufferedReader(new InputStreamReader(inputStream)); tok = new StringTokenizer(""); } } }