結果
問題 | No.527 ナップサック容量問題 |
ユーザー | tookunn_1213 |
提出日時 | 2017-06-09 23:59:47 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,391 bytes |
コンパイル時間 | 3,189 ms |
コンパイル使用メモリ | 77,964 KB |
実行使用メモリ | 54,892 KB |
最終ジャッジ日時 | 2023-10-24 03:29:31 |
合計ジャッジ時間 | 7,814 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
53,404 KB |
testcase_01 | AC | 56 ms
53,408 KB |
testcase_02 | WA | - |
testcase_03 | AC | 55 ms
53,404 KB |
testcase_04 | AC | 56 ms
53,412 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 95 ms
54,604 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 106 ms
54,396 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 79 ms
54,536 KB |
testcase_15 | AC | 86 ms
52,556 KB |
testcase_16 | AC | 55 ms
53,400 KB |
testcase_17 | AC | 81 ms
54,612 KB |
testcase_18 | AC | 84 ms
54,612 KB |
testcase_19 | AC | 56 ms
53,400 KB |
testcase_20 | AC | 81 ms
54,668 KB |
testcase_21 | AC | 118 ms
54,728 KB |
testcase_22 | AC | 93 ms
54,656 KB |
testcase_23 | AC | 118 ms
54,728 KB |
testcase_24 | AC | 70 ms
54,236 KB |
testcase_25 | AC | 94 ms
54,748 KB |
testcase_26 | AC | 87 ms
54,780 KB |
testcase_27 | AC | 89 ms
54,740 KB |
testcase_28 | AC | 85 ms
54,808 KB |
testcase_29 | AC | 117 ms
54,800 KB |
testcase_30 | WA | - |
testcase_31 | AC | 80 ms
54,636 KB |
testcase_32 | AC | 85 ms
54,616 KB |
testcase_33 | AC | 84 ms
54,668 KB |
testcase_34 | AC | 86 ms
54,684 KB |
testcase_35 | AC | 89 ms
54,660 KB |
testcase_36 | AC | 56 ms
53,404 KB |
testcase_37 | AC | 81 ms
54,836 KB |
testcase_38 | AC | 86 ms
54,616 KB |
testcase_39 | AC | 82 ms
54,604 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.NoSuchElementException; public class Main{ int N,V; int[] v,w; public void solve() { N = nextInt(); v = new int[N]; w = new int[N]; for(int i = 0;i < N;i++){ v[i] = nextInt(); w[i] = nextInt(); } V = nextInt(); int[] dp = new int[N * 1000 + 1]; for(int i = 0;i < N;i++){ for(int j = N * 1000;j >= 0;j--){ if(j + w[i] <= N * 1000)dp[j+w[i]] = Math.max(dp[j+w[i]],dp[j]+v[i]); } } int lower = lowerBound(dp,V); int upper = upperBound(dp,V); out.println(lower); out.println(upper <= N * 1000 ? upper : "inf"); } public int upperBound(int[] a,int b){ int low = 1; int high = a.length; while(high - low > 1){ int mid = high+low >> 1; if(a[mid] > b){ high = mid; }else{ low = mid; } } return low; } public int lowerBound(int[] a,int b){ int low = 0; int high = a.length; while(high - low > 1){ int mid = high+low >> 1; if(a[mid] >= b){ high = mid; }else{ low = mid; } } return high; } public static void main(String[] args) { out.flush(); new Main().solve(); out.close(); } /* Input */ private static final InputStream in = System.in; private static final PrintWriter out = new PrintWriter(System.out); private final byte[] buffer = new byte[2048]; private int p = 0; private int buflen = 0; private boolean hasNextByte() { if (p < buflen) return true; p = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) return false; return true; } public boolean hasNext() { while (hasNextByte() && !isPrint(buffer[p])) { p++; } return hasNextByte(); } private boolean isPrint(int ch) { if (ch >= '!' && ch <= '~') return true; return false; } private int nextByte() { if (!hasNextByte()) return -1; return buffer[p++]; } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = -1; while (isPrint((b = nextByte()))) { sb.appendCodePoint(b); } return sb.toString(); } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } }