#179119 (Java21) No.527 ナップサック容量問題

• 問題: No.527 ナップサック容量問題
• ユーザー: schwarzahl
• 提出日時: 2017-06-10 01:29:00
• 言語: Java21 (openjdk 21)
• 結果: WA
• 実行時間: -
• コード長: 2,095 bytes
• コンパイル時間: 2,500 ms
• コンパイル使用メモリ: 80,260 KB
• 実行使用メモリ: 67,900 KB
• 最終ジャッジ日時: 2024-09-22 21:39:55
• 合計ジャッジ時間: 12,139 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	137 ms; 54,148 KB
testcase_01	AC	137 ms; 53,912 KB
testcase_02	AC	137 ms; 54,200 KB
testcase_03	WA	-
testcase_04	AC	135 ms; 54,024 KB
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	AC	140 ms; 54,112 KB
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	138 ms; 42,168 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	136 ms; 41,808 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	144 ms; 42,100 KB
testcase_26	AC	194 ms; 45,040 KB
testcase_27	AC	176 ms; 42,476 KB
testcase_28	AC	144 ms; 42,128 KB
testcase_29	AC	218 ms; 45,904 KB
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	AC	138 ms; 41,924 KB
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-

ソースコード

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;

public class Main {
	public static void main(String[] args){
		Main main = new Main();
		main.solveC();
	}

	private void solveA() {
		Scanner sc = new Scanner(System.in);
		String line = sc.nextLine();
		int h = c2i(line.charAt(0)) * 10 + c2i(line.charAt(1));
		int m = c2i(line.charAt(3)) * 10 + c2i(line.charAt(4));
		m += 5;
		if (m >= 60) {
			m -= 60;
			h += 1;
			h = h % 24;
		}
		System.out.printf("%02d:%02d", h, m);
	}

	private int c2i(char c) {
		return c - '0';
	}

	private void solveB() {
		Scanner sc = new Scanner(System.in);
		long N = sc.nextLong();
		long M = sc.nextLong();

		long pp = 0;
		long p = 1;
		for (int n = 3; n <= N; n++) {
			long now = (pp + p) % M;
			pp = p;
			p = now;
		}
		System.out.println(p);
	}

	private void solveC() {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		List<Budget> list = new ArrayList<>();
		for (int i = 0; i < N; i++) {
			Budget b = new Budget();
			b.v = sc.nextInt();
			b.w = sc.nextInt();
			list.add(b);
		}
		int V = sc.nextInt();

		int[] values = new int[100001];

		Set<Integer> set = new HashSet<>();
		set.add(0);
		for (Budget b : list) {
			Set<Integer> next_set = new HashSet<>();
			for (int weight : set) {
				int tmp_v = values[weight];
				int next_v = tmp_v + b.v;
				int next_w = weight + b.w;
				if (next_w < 100001 && next_v > values[next_w]) {
					values[next_w] = next_v;
					if (next_v < V) {
						next_set.add(next_w);
					}
				}
				next_set.add(weight);
			}
			set = next_set;
		}
		int min = 1;
		Integer max = null;
		for (int wi = 0; wi < 100001; wi++) {
			if (V > 0 && values[wi] == V) {
				min = wi;
			}
			if (max == null && values[wi] > V) {
				max = wi;
			}
		}
		System.out.println(min);
		System.out.println(max == null ? "inf" : max - 1);
	}

	class Budget {
		int v;
		int w;

		public int getValue() {
			return v;
		}

		public int getWeight() {
			return w;
		}
	}
}