結果
問題 | No.247 線形計画問題もどき |
ユーザー | uwi |
提出日時 | 2015-07-19 16:01:26 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 87 ms / 2,000 ms |
コード長 | 3,093 bytes |
コンパイル時間 | 4,708 ms |
コンパイル使用メモリ | 80,752 KB |
実行使用メモリ | 38,300 KB |
最終ジャッジ日時 | 2024-07-07 11:06:12 |
合計ジャッジ時間 | 6,580 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
38,032 KB |
testcase_01 | AC | 45 ms
36,848 KB |
testcase_02 | AC | 87 ms
38,284 KB |
testcase_03 | AC | 45 ms
36,808 KB |
testcase_04 | AC | 44 ms
36,808 KB |
testcase_05 | AC | 43 ms
36,968 KB |
testcase_06 | AC | 44 ms
36,716 KB |
testcase_07 | AC | 53 ms
37,484 KB |
testcase_08 | AC | 49 ms
37,164 KB |
testcase_09 | AC | 45 ms
36,864 KB |
testcase_10 | AC | 46 ms
37,224 KB |
testcase_11 | AC | 43 ms
36,652 KB |
testcase_12 | AC | 44 ms
37,044 KB |
testcase_13 | AC | 44 ms
36,840 KB |
testcase_14 | AC | 46 ms
36,988 KB |
testcase_15 | AC | 45 ms
36,752 KB |
testcase_16 | AC | 45 ms
36,728 KB |
testcase_17 | AC | 70 ms
37,868 KB |
testcase_18 | AC | 52 ms
36,824 KB |
testcase_19 | AC | 80 ms
38,228 KB |
testcase_20 | AC | 69 ms
38,248 KB |
testcase_21 | AC | 46 ms
36,948 KB |
testcase_22 | AC | 55 ms
37,188 KB |
testcase_23 | AC | 49 ms
36,924 KB |
testcase_24 | AC | 71 ms
38,300 KB |
testcase_25 | AC | 70 ms
38,256 KB |
testcase_26 | AC | 67 ms
37,824 KB |
testcase_27 | AC | 64 ms
37,028 KB |
ソースコード
package q6xx; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Q678 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int C = ni(); int n = ni(); int[] a = na(n); int[] dp = new int[C+1]; Arrays.fill(dp, 999999); dp[0] = 0; for(int i = 0;i < n;i++){ for(int j = a[i];j <= C;j++){ dp[j] = Math.min(dp[j], dp[j-a[i]] + 1); } } if(dp[C] == 999999){ out.println(-1); return; } out.println(dp[C]); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Q678().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }