結果
問題 | No.45 回転寿司 |
ユーザー | tutuz |
提出日時 | 2018-09-22 08:41:57 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 446 ms / 5,000 ms |
コード長 | 3,314 bytes |
コンパイル時間 | 1,879 ms |
コンパイル使用メモリ | 76,500 KB |
実行使用メモリ | 254,832 KB |
最終ジャッジ日時 | 2023-08-27 16:37:44 |
合計ジャッジ時間 | 8,841 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 131 ms
85,016 KB |
testcase_01 | AC | 198 ms
128,320 KB |
testcase_02 | AC | 327 ms
224,420 KB |
testcase_03 | AC | 365 ms
224,320 KB |
testcase_04 | AC | 203 ms
128,932 KB |
testcase_05 | AC | 80 ms
54,540 KB |
testcase_06 | AC | 167 ms
112,092 KB |
testcase_07 | AC | 328 ms
224,196 KB |
testcase_08 | AC | 91 ms
66,220 KB |
testcase_09 | AC | 361 ms
227,424 KB |
testcase_10 | AC | 135 ms
88,744 KB |
testcase_11 | AC | 89 ms
64,840 KB |
testcase_12 | AC | 350 ms
225,696 KB |
testcase_13 | AC | 70 ms
54,744 KB |
testcase_14 | AC | 74 ms
52,456 KB |
testcase_15 | AC | 146 ms
112,600 KB |
testcase_16 | AC | 102 ms
77,316 KB |
testcase_17 | AC | 125 ms
84,568 KB |
testcase_18 | AC | 105 ms
76,924 KB |
testcase_19 | AC | 259 ms
185,904 KB |
testcase_20 | AC | 63 ms
52,204 KB |
testcase_21 | AC | 70 ms
54,692 KB |
testcase_22 | AC | 51 ms
51,108 KB |
testcase_23 | AC | 50 ms
50,976 KB |
testcase_24 | AC | 51 ms
50,764 KB |
testcase_25 | AC | 51 ms
50,704 KB |
testcase_26 | AC | 149 ms
111,492 KB |
testcase_27 | AC | 252 ms
186,000 KB |
testcase_28 | AC | 158 ms
111,668 KB |
testcase_29 | AC | 219 ms
144,144 KB |
testcase_30 | AC | 246 ms
186,660 KB |
testcase_31 | AC | 50 ms
50,828 KB |
testcase_32 | AC | 51 ms
50,708 KB |
testcase_33 | AC | 446 ms
254,832 KB |
ソースコード
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[][] memo; public void solve(int testNumber, InputReader in, PrintWriter out) { n = in.nextInt(); a = in.nextIntArray(n); int sum = Arrays.stream(a).sum(); memo = new int[n+1][sum+1]; fill(memo, -1); int ans = f(0, 0); out.println(ans); } int f(int now, int v) { if (now >= n) { return v; } 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(""); } } }