結果
問題 | No.496 ワープクリスタル (給料日前編) |
ユーザー | hiromi_ayase |
提出日時 | 2017-03-24 23:00:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 73 ms / 2,000 ms |
コード長 | 3,622 bytes |
コンパイル時間 | 2,249 ms |
コンパイル使用メモリ | 74,032 KB |
実行使用メモリ | 54,596 KB |
最終ジャッジ日時 | 2023-09-20 02:45:23 |
合計ジャッジ時間 | 4,814 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
49,472 KB |
testcase_01 | AC | 42 ms
49,416 KB |
testcase_02 | AC | 42 ms
49,536 KB |
testcase_03 | AC | 42 ms
49,332 KB |
testcase_04 | AC | 42 ms
49,308 KB |
testcase_05 | AC | 41 ms
49,132 KB |
testcase_06 | AC | 41 ms
49,256 KB |
testcase_07 | AC | 41 ms
49,312 KB |
testcase_08 | AC | 73 ms
54,324 KB |
testcase_09 | AC | 68 ms
54,060 KB |
testcase_10 | AC | 44 ms
47,272 KB |
testcase_11 | AC | 43 ms
49,140 KB |
testcase_12 | AC | 45 ms
49,304 KB |
testcase_13 | AC | 46 ms
49,232 KB |
testcase_14 | AC | 52 ms
49,980 KB |
testcase_15 | AC | 45 ms
49,536 KB |
testcase_16 | AC | 45 ms
49,472 KB |
testcase_17 | AC | 52 ms
49,972 KB |
testcase_18 | AC | 50 ms
49,996 KB |
testcase_19 | AC | 50 ms
49,296 KB |
testcase_20 | AC | 47 ms
49,364 KB |
testcase_21 | AC | 44 ms
49,260 KB |
testcase_22 | AC | 70 ms
54,372 KB |
testcase_23 | AC | 70 ms
54,340 KB |
testcase_24 | AC | 72 ms
54,596 KB |
testcase_25 | AC | 69 ms
54,120 KB |
testcase_26 | AC | 71 ms
54,432 KB |
ソースコード
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 gx = sc.nextInt(); int gy = sc.nextInt(); int N = sc.nextInt(); int F = sc.nextInt(); int[][] w = new int[N][3]; for (int i = 0; i < N; i ++) { int x = sc.nextInt(); int y = sc.nextInt(); int c = sc.nextInt(); if ((x + y) * F > c) { w[i][0] = x; w[i][1] = y; w[i][2] = c; } } int[][][] dp = new int[N + 1][gx + 1][gy + 1]; for (int i = 0; i <= N; i ++) { for (int x = 0; x <= gx; x ++) { for (int y = 0; y <= gy; y ++) { if (i == 0) { dp[i][x][y] = (x + y) * F; } else { if (x >= w[i - 1][0] && y >= w[i - 1][1]) { dp[i][x][y] = Math.min(dp[i - 1][x][y], dp[i - 1][x - w[i - 1][0]][y - w[i - 1][1]] + w[i - 1][2]); } else { dp[i][x][y] = dp[i - 1][x][y]; } } } } } System.out.println(dp[N][gx][gy]); } } 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; } }