結果
問題 | No.505 カードの数式2 |
ユーザー | hiromi_ayase |
提出日時 | 2017-04-21 23:24:27 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,910 bytes |
コンパイル時間 | 3,761 ms |
コンパイル使用メモリ | 77,960 KB |
実行使用メモリ | 52,116 KB |
最終ジャッジ日時 | 2024-07-20 17:45:05 |
合計ジャッジ時間 | 4,335 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
36,892 KB |
testcase_01 | AC | 44 ms
36,304 KB |
testcase_02 | AC | 43 ms
36,320 KB |
testcase_03 | AC | 45 ms
36,600 KB |
testcase_04 | AC | 44 ms
36,176 KB |
testcase_05 | AC | 45 ms
36,320 KB |
testcase_06 | AC | 47 ms
36,584 KB |
testcase_07 | AC | 47 ms
36,828 KB |
testcase_08 | AC | 45 ms
36,760 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 44 ms
36,600 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 45 ms
36,380 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 47 ms
36,912 KB |
testcase_20 | AC | 49 ms
36,852 KB |
testcase_21 | AC | 49 ms
36,728 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 44 ms
36,724 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) { FastScanner sc = new FastScanner(); int N = sc.nextInt(); int[] a = sc.nextIntList(N); long[][] dp = new long[N + 1][2]; for (int i = 0; i < N; i ++) { long x1 = dp[i][0] * a[i]; long x2 = dp[i][1] * a[i]; long x3 = dp[i][0] + a[i]; long x4 = dp[i][1] + a[i]; long x5 = dp[i][0] - a[i]; long x6 = dp[i][1] - a[i]; dp[i + 1][0] = x1; dp[i + 1][1] = x1; dp[i + 1][0] = Math.max(dp[i + 1][0], x2); dp[i + 1][0] = Math.max(dp[i + 1][0], x3); dp[i + 1][0] = Math.max(dp[i + 1][0], x4); dp[i + 1][0] = Math.max(dp[i + 1][0], x5); dp[i + 1][0] = Math.max(dp[i + 1][0], x6); dp[i + 1][1] = Math.min(dp[i + 1][1], x2); dp[i + 1][1] = Math.min(dp[i + 1][1], x3); dp[i + 1][1] = Math.min(dp[i + 1][1], x4); dp[i + 1][1] = Math.min(dp[i + 1][1], x5); dp[i + 1][1] = Math.min(dp[i + 1][1], x6); if (a[i] != 0) { long x7 = dp[i][0] / a[i]; long x8 = dp[i][1] / a[i]; dp[i + 1][1] = Math.min(dp[i + 1][1], x7); dp[i + 1][1] = Math.min(dp[i + 1][1], x8); dp[i + 1][0] = Math.max(dp[i + 1][0], x7); dp[i + 1][0] = Math.max(dp[i + 1][0], x8); } } System.out.println(dp[N][0]); } } class FastScanner { public static String debug = null; private final InputStream in = System.in; private int ptr = 0; private int buflen = 0; private byte[] buffer = new byte[1024]; private boolean eos = false; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { if (debug != null) { buflen = debug.length(); buffer = debug.getBytes(); debug = ""; eos = true; } else { buflen = in.read(buffer); } } catch (IOException e) { e.printStackTrace(); } if (buflen < 0) { eos = true; return false; } else if (buflen == 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } public boolean isEOS() { return this.eos; } public boolean hasNext() { skipUnprintable(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { return (int) nextLong(); } public long[] nextLongList(int n) { return nextLongTable(1, n)[0]; } public int[] nextIntList(int n) { return nextIntTable(1, n)[0]; } public long[][] nextLongTable(int n, int m) { long[][] ret = new long[n][m]; for (int i = 0; i < n; i ++) { for (int j = 0; j < m; j ++) { ret[i][j] = nextLong(); } } return ret; } public int[][] nextIntTable(int n, int m) { int[][] ret = new int[n][m]; for (int i = 0; i < n; i ++) { for (int j = 0; j < m; j ++) { ret[i][j] = nextInt(); } } return ret; } }