結果

問題 No.393 2本の竹
ユーザー uwiuwi
提出日時 2016-07-12 23:54:55
言語 Java21
(openjdk 21)
結果
AC  
実行時間 292 ms / 1,000 ms
コード長 3,436 bytes
コンパイル時間 3,920 ms
コンパイル使用メモリ 80,712 KB
実行使用メモリ 45,496 KB
最終ジャッジ日時 2024-11-08 05:46:23
合計ジャッジ時間 8,229 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
36,772 KB
testcase_01 AC 54 ms
36,936 KB
testcase_02 AC 53 ms
36,932 KB
testcase_03 AC 55 ms
37,216 KB
testcase_04 AC 53 ms
36,992 KB
testcase_05 AC 54 ms
36,724 KB
testcase_06 AC 53 ms
37,148 KB
testcase_07 AC 61 ms
37,152 KB
testcase_08 AC 63 ms
37,452 KB
testcase_09 AC 248 ms
45,064 KB
testcase_10 AC 254 ms
45,404 KB
testcase_11 AC 273 ms
45,140 KB
testcase_12 AC 261 ms
45,168 KB
testcase_13 AC 138 ms
44,992 KB
testcase_14 AC 174 ms
44,948 KB
testcase_15 AC 134 ms
42,376 KB
testcase_16 AC 126 ms
43,960 KB
testcase_17 AC 58 ms
37,128 KB
testcase_18 AC 57 ms
36,976 KB
testcase_19 AC 54 ms
36,756 KB
testcase_20 AC 55 ms
37,144 KB
testcase_21 AC 57 ms
37,048 KB
testcase_22 AC 286 ms
45,264 KB
testcase_23 AC 165 ms
44,652 KB
testcase_24 AC 65 ms
37,564 KB
testcase_25 AC 61 ms
37,384 KB
testcase_26 AC 54 ms
37,148 KB
testcase_27 AC 292 ms
45,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

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 NO393 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		for(int T = ni();T > 0;T--){
			int A = ni(), B = ni();
			int n = ni();
			int[] a = na(n);
			Arrays.sort(a);
			boolean[] dp = new boolean[A+1];
			int sum = 0;
			int ret = 0;
			dp[0] = true;
			for(int i = 0;i < n;i++){
				for(boolean x : dp){
					if(x){
						ret = i;
					}
				}
				boolean[] ndp = new boolean[A+1];
				for(int j = 0;j <= A;j++){
					if(dp[j]){
						int inb = sum - j;
						if(j + a[i] <= A){
							ndp[j+a[i]] = true;
						}
						if(inb + a[i] <= B){
							ndp[j] = true;
						}
					}
				}
				sum += a[i];
				dp = ndp;
			}
			for(boolean x : dp){
				if(x){
					ret = n;
				}
			}
			out.println(ret);
		}
	}
	
	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 NO393().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)); }
}
0