結果

問題 No.527 ナップサック容量問題
ユーザー uwiuwi
提出日時 2017-06-09 22:27:57
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,580 bytes
コンパイル時間 4,298 ms
コンパイル使用メモリ 88,764 KB
実行使用メモリ 52,028 KB
最終ジャッジ日時 2024-09-22 15:08:01
合計ジャッジ時間 8,606 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
50,524 KB
testcase_01 WA -
testcase_02 AC 64 ms
50,808 KB
testcase_03 AC 67 ms
50,008 KB
testcase_04 WA -
testcase_05 AC 93 ms
51,576 KB
testcase_06 AC 103 ms
51,912 KB
testcase_07 AC 99 ms
51,968 KB
testcase_08 AC 91 ms
51,956 KB
testcase_09 AC 62 ms
50,448 KB
testcase_10 AC 105 ms
51,772 KB
testcase_11 AC 97 ms
51,812 KB
testcase_12 AC 94 ms
51,704 KB
testcase_13 AC 106 ms
51,780 KB
testcase_14 AC 90 ms
51,996 KB
testcase_15 AC 99 ms
52,028 KB
testcase_16 AC 67 ms
50,668 KB
testcase_17 AC 94 ms
51,740 KB
testcase_18 AC 95 ms
51,736 KB
testcase_19 AC 68 ms
50,468 KB
testcase_20 AC 88 ms
51,708 KB
testcase_21 AC 110 ms
51,884 KB
testcase_22 AC 99 ms
51,792 KB
testcase_23 AC 110 ms
51,900 KB
testcase_24 AC 87 ms
51,936 KB
testcase_25 WA -
testcase_26 AC 98 ms
51,732 KB
testcase_27 AC 95 ms
51,956 KB
testcase_28 WA -
testcase_29 AC 109 ms
51,928 KB
testcase_30 AC 89 ms
51,208 KB
testcase_31 AC 95 ms
51,748 KB
testcase_32 AC 95 ms
51,828 KB
testcase_33 AC 95 ms
52,000 KB
testcase_34 AC 97 ms
51,752 KB
testcase_35 AC 94 ms
51,680 KB
testcase_36 WA -
testcase_37 AC 92 ms
51,580 KB
testcase_38 AC 95 ms
51,928 KB
testcase_39 AC 94 ms
51,676 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170609;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[][] is = new int[n][];
		for(int i = 0;i < n;i++){
			is[i] = na(2);
		}
		int[] dp = new int[100005];
		Arrays.fill(dp, -99999999);
		dp[0] = 0;
		for(int[] u : is){
			for(int i = dp.length-1;i >= u[1];i--){
				dp[i] = Math.max(dp[i], dp[i-u[1]] + u[0]);
			}
		}
		int V = ni();
		int st = 0;
		for(int i = 1;i < dp.length;i++){
			if(dp[i] == V){
				if(st == 0){
					out.println(i);
					st = 1;
				}
			}else if(dp[i] > V){
				if(st == 1){
					out.println(i-1);
					st = 2;
				}
			}
		}
		if(st == 1){
			out.println("inf");
		}
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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)); }
}
0