oj.uz

Submission #469430

# Submission time Handle Problem Language Result Execution time Memory
469430 2021-09-01T01:09:48 Z ImaginaryIQ Knapsack (NOI18_knapsack) Java 11
73 / 100
 1000 ms 59636 KB 
import java.io.*;
import java.util.*;

public class knapsack {
	public static void main(String[] args) throws IOException {
		BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer initial = new StringTokenizer(read.readLine());
		int limit = Integer.parseInt(initial.nextToken());
		int typeNum = Integer.parseInt(initial.nextToken());
		HashMap<Integer, ArrayList<int[]>> byWeight = new HashMap<>();
		for (int t = 0; t < typeNum; t++) {
			StringTokenizer item = new StringTokenizer(read.readLine());
			int value = Integer.parseInt(item.nextToken());
			int weight = Integer.parseInt(item.nextToken());
			int amt = Integer.parseInt(item.nextToken());
			if (weight <= limit && amt > 0) {
				if (!byWeight.containsKey(weight)) {
					byWeight.put(weight, new ArrayList<>());
				}
				byWeight.get(weight).add(new int[] {value, amt});
			}
		}

		/*
		 * best[i][j] contains the most value we can
		 * get using j weight and the first i weight types
		 */
		long[][] best = new long[byWeight.size() + 1][limit + 1];
		for (long[] row : best) {
			Arrays.fill(row, Integer.MIN_VALUE);
		}
		best[0][0] = 0;
		int at = 1;
		for (var pair : byWeight.entrySet()) {
			int w = pair.getKey();
			ArrayList<int[]> items = pair.getValue();
			// sort items in reverse order by value
			items.sort(Comparator.comparingInt(i -> -i[0]));
			for (int i = 0; i <= limit; i++) {
				best[at][i] = best[at - 1][i];
				int copies = 0;
				int typeAt = 0;
				int currUsed = 0;
				long profit = 0;
				// go through as many items until we run out of items or usable weight
				while ((copies + 1) * w <= i && typeAt < items.size()) {
					copies++;
					profit += items.get(typeAt)[0];
					if (best[at - 1][i - copies * w] != Integer.MIN_VALUE) {
						best[at][i] = Math.max(
							best[at][i],
							best[at - 1][i - copies * w] + profit
						);
					}
					currUsed++;
					if (currUsed == items.get(typeAt)[1]) {
						currUsed = 0;
						typeAt++;
					}
				}
			}
			at++;
		}

		long mostValue = 0;
		for (int i = 0; i <= limit; i++) {
			mostValue = Math.max(mostValue, best[byWeight.size()][i]);
		}
		System.out.println(mostValue);
	}
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 9084 KB Output is correct
2 Correct 83 ms 9068 KB Output is correct
3 Correct 110 ms 10536 KB Output is correct
4 Correct 84 ms 8852 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 9048 KB Output is correct
2 Correct 114 ms 10460 KB Output is correct
3 Correct 116 ms 10272 KB Output is correct
4 Correct 88 ms 9204 KB Output is correct
5 Correct 90 ms 9156 KB Output is correct
6 Correct 133 ms 14224 KB Output is correct
7 Correct 133 ms 14500 KB Output is correct
8 Correct 129 ms 14608 KB Output is correct
9 Correct 129 ms 14420 KB Output is correct
10 Correct 136 ms 14488 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 9048 KB Output is correct
2 Correct 114 ms 10460 KB Output is correct
3 Correct 116 ms 10272 KB Output is correct
4 Correct 88 ms 9204 KB Output is correct
5 Correct 90 ms 9156 KB Output is correct
6 Correct 133 ms 14224 KB Output is correct
7 Correct 133 ms 14500 KB Output is correct
8 Correct 129 ms 14608 KB Output is correct
9 Correct 129 ms 14420 KB Output is correct
10 Correct 136 ms 14488 KB Output is correct
11 Correct 87 ms 8968 KB Output is correct
12 Correct 146 ms 11736 KB Output is correct
13 Correct 113 ms 10664 KB Output is correct
14 Correct 92 ms 9156 KB Output is correct
15 Correct 89 ms 9208 KB Output is correct
16 Correct 138 ms 14516 KB Output is correct
17 Correct 128 ms 14524 KB Output is correct
18 Correct 133 ms 14592 KB Output is correct
19 Correct 135 ms 14656 KB Output is correct
20 Correct 133 ms 14436 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 9084 KB Output is correct
2 Correct 83 ms 9068 KB Output is correct
3 Correct 110 ms 10536 KB Output is correct
4 Correct 84 ms 8852 KB Output is correct
5 Correct 87 ms 9048 KB Output is correct
6 Correct 114 ms 10460 KB Output is correct
7 Correct 116 ms 10272 KB Output is correct
8 Correct 88 ms 9204 KB Output is correct
9 Correct 90 ms 9156 KB Output is correct
10 Correct 133 ms 14224 KB Output is correct
11 Correct 133 ms 14500 KB Output is correct
12 Correct 129 ms 14608 KB Output is correct
13 Correct 129 ms 14420 KB Output is correct
14 Correct 136 ms 14488 KB Output is correct
15 Correct 87 ms 8968 KB Output is correct
16 Correct 146 ms 11736 KB Output is correct
17 Correct 113 ms 10664 KB Output is correct
18 Correct 92 ms 9156 KB Output is correct
19 Correct 89 ms 9208 KB Output is correct
20 Correct 138 ms 14516 KB Output is correct
21 Correct 128 ms 14524 KB Output is correct
22 Correct 133 ms 14592 KB Output is correct
23 Correct 135 ms 14656 KB Output is correct
24 Correct 133 ms 14436 KB Output is correct
25 Correct 88 ms 9012 KB Output is correct
26 Correct 133 ms 10544 KB Output is correct
27 Correct 119 ms 10332 KB Output is correct
28 Correct 92 ms 9416 KB Output is correct
29 Correct 95 ms 9112 KB Output is correct
30 Correct 140 ms 14476 KB Output is correct
31 Correct 129 ms 14408 KB Output is correct
32 Correct 130 ms 14728 KB Output is correct
33 Correct 131 ms 14384 KB Output is correct
34 Correct 133 ms 14408 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 9084 KB Output is correct
2 Correct 83 ms 9068 KB Output is correct
3 Correct 110 ms 10536 KB Output is correct
4 Correct 84 ms 8852 KB Output is correct
5 Correct 87 ms 9048 KB Output is correct
6 Correct 114 ms 10460 KB Output is correct
7 Correct 116 ms 10272 KB Output is correct
8 Correct 88 ms 9204 KB Output is correct
9 Correct 90 ms 9156 KB Output is correct
10 Correct 133 ms 14224 KB Output is correct
11 Correct 133 ms 14500 KB Output is correct
12 Correct 129 ms 14608 KB Output is correct
13 Correct 129 ms 14420 KB Output is correct
14 Correct 136 ms 14488 KB Output is correct
15 Correct 87 ms 8968 KB Output is correct
16 Correct 146 ms 11736 KB Output is correct
17 Correct 113 ms 10664 KB Output is correct
18 Correct 92 ms 9156 KB Output is correct
19 Correct 89 ms 9208 KB Output is correct
20 Correct 138 ms 14516 KB Output is correct
21 Correct 128 ms 14524 KB Output is correct
22 Correct 133 ms 14592 KB Output is correct
23 Correct 135 ms 14656 KB Output is correct
24 Correct 133 ms 14436 KB Output is correct
25 Correct 88 ms 9012 KB Output is correct
26 Correct 133 ms 10544 KB Output is correct
27 Correct 119 ms 10332 KB Output is correct
28 Correct 92 ms 9416 KB Output is correct
29 Correct 95 ms 9112 KB Output is correct
30 Correct 140 ms 14476 KB Output is correct
31 Correct 129 ms 14408 KB Output is correct
32 Correct 130 ms 14728 KB Output is correct
33 Correct 131 ms 14384 KB Output is correct
34 Correct 133 ms 14408 KB Output is correct
35 Correct 631 ms 20356 KB Output is correct
36 Correct 691 ms 21008 KB Output is correct
37 Correct 655 ms 20612 KB Output is correct
38 Correct 733 ms 21096 KB Output is correct
39 Correct 654 ms 21612 KB Output is correct
40 Correct 831 ms 53752 KB Output is correct
41 Correct 820 ms 59308 KB Output is correct
42 Correct 863 ms 59636 KB Output is correct
43 Correct 931 ms 59404 KB Output is correct
44 Correct 984 ms 59596 KB Output is correct
45 Correct 721 ms 25732 KB Output is correct
46 Correct 425 ms 21308 KB Output is correct
47 Correct 832 ms 27360 KB Output is correct
48 Execution timed out 1012 ms 38436 KB Time limit exceeded
49 Halted 0 ms 0 KB -