oj.uz

Submission #450510

# Submission time Handle Problem Language Result Execution time Memory
450510 2021-08-03T00:37:24 Z SansPapyrus683 Knapsack (NOI18_knapsack) Java 11
73 / 100
 1000 ms 58072 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 && 0 <= amt) {
				if (!byWeight.containsKey(weight)) {
					byWeight.put(weight, new ArrayList<>());
				}
				byWeight.get(weight).add(new int[] {value, amt});
			}
		}

		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();
			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 curr_used = 0;
				long profit = 0;
				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
						);
					}
					curr_used++;
					if (curr_used == items.get(typeAt)[1]) {
						curr_used = 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 102 ms 8968 KB Output is correct
2 Correct 84 ms 9092 KB Output is correct
3 Correct 126 ms 10376 KB Output is correct
4 Correct 88 ms 8696 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 8844 KB Output is correct
2 Correct 128 ms 10324 KB Output is correct
3 Correct 123 ms 10368 KB Output is correct
4 Correct 94 ms 8996 KB Output is correct
5 Correct 89 ms 9120 KB Output is correct
6 Correct 131 ms 14168 KB Output is correct
7 Correct 142 ms 14320 KB Output is correct
8 Correct 139 ms 14328 KB Output is correct
9 Correct 155 ms 14296 KB Output is correct
10 Correct 133 ms 14348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 8844 KB Output is correct
2 Correct 128 ms 10324 KB Output is correct
3 Correct 123 ms 10368 KB Output is correct
4 Correct 94 ms 8996 KB Output is correct
5 Correct 89 ms 9120 KB Output is correct
6 Correct 131 ms 14168 KB Output is correct
7 Correct 142 ms 14320 KB Output is correct
8 Correct 139 ms 14328 KB Output is correct
9 Correct 155 ms 14296 KB Output is correct
10 Correct 133 ms 14348 KB Output is correct
11 Correct 96 ms 8912 KB Output is correct
12 Correct 151 ms 11524 KB Output is correct
13 Correct 126 ms 10332 KB Output is correct
14 Correct 106 ms 9008 KB Output is correct
15 Correct 93 ms 9048 KB Output is correct
16 Correct 138 ms 14512 KB Output is correct
17 Correct 140 ms 14128 KB Output is correct
18 Correct 136 ms 14348 KB Output is correct
19 Correct 144 ms 14408 KB Output is correct
20 Correct 145 ms 14376 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 8968 KB Output is correct
2 Correct 84 ms 9092 KB Output is correct
3 Correct 126 ms 10376 KB Output is correct
4 Correct 88 ms 8696 KB Output is correct
5 Correct 115 ms 8844 KB Output is correct
6 Correct 128 ms 10324 KB Output is correct
7 Correct 123 ms 10368 KB Output is correct
8 Correct 94 ms 8996 KB Output is correct
9 Correct 89 ms 9120 KB Output is correct
10 Correct 131 ms 14168 KB Output is correct
11 Correct 142 ms 14320 KB Output is correct
12 Correct 139 ms 14328 KB Output is correct
13 Correct 155 ms 14296 KB Output is correct
14 Correct 133 ms 14348 KB Output is correct
15 Correct 96 ms 8912 KB Output is correct
16 Correct 151 ms 11524 KB Output is correct
17 Correct 126 ms 10332 KB Output is correct
18 Correct 106 ms 9008 KB Output is correct
19 Correct 93 ms 9048 KB Output is correct
20 Correct 138 ms 14512 KB Output is correct
21 Correct 140 ms 14128 KB Output is correct
22 Correct 136 ms 14348 KB Output is correct
23 Correct 144 ms 14408 KB Output is correct
24 Correct 145 ms 14376 KB Output is correct
25 Correct 87 ms 8964 KB Output is correct
26 Correct 175 ms 10392 KB Output is correct
27 Correct 150 ms 10288 KB Output is correct
28 Correct 113 ms 8984 KB Output is correct
29 Correct 114 ms 8976 KB Output is correct
30 Correct 148 ms 14512 KB Output is correct
31 Correct 159 ms 14292 KB Output is correct
32 Correct 138 ms 14276 KB Output is correct
33 Correct 135 ms 14408 KB Output is correct
34 Correct 143 ms 14304 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 8968 KB Output is correct
2 Correct 84 ms 9092 KB Output is correct
3 Correct 126 ms 10376 KB Output is correct
4 Correct 88 ms 8696 KB Output is correct
5 Correct 115 ms 8844 KB Output is correct
6 Correct 128 ms 10324 KB Output is correct
7 Correct 123 ms 10368 KB Output is correct
8 Correct 94 ms 8996 KB Output is correct
9 Correct 89 ms 9120 KB Output is correct
10 Correct 131 ms 14168 KB Output is correct
11 Correct 142 ms 14320 KB Output is correct
12 Correct 139 ms 14328 KB Output is correct
13 Correct 155 ms 14296 KB Output is correct
14 Correct 133 ms 14348 KB Output is correct
15 Correct 96 ms 8912 KB Output is correct
16 Correct 151 ms 11524 KB Output is correct
17 Correct 126 ms 10332 KB Output is correct
18 Correct 106 ms 9008 KB Output is correct
19 Correct 93 ms 9048 KB Output is correct
20 Correct 138 ms 14512 KB Output is correct
21 Correct 140 ms 14128 KB Output is correct
22 Correct 136 ms 14348 KB Output is correct
23 Correct 144 ms 14408 KB Output is correct
24 Correct 145 ms 14376 KB Output is correct
25 Correct 87 ms 8964 KB Output is correct
26 Correct 175 ms 10392 KB Output is correct
27 Correct 150 ms 10288 KB Output is correct
28 Correct 113 ms 8984 KB Output is correct
29 Correct 114 ms 8976 KB Output is correct
30 Correct 148 ms 14512 KB Output is correct
31 Correct 159 ms 14292 KB Output is correct
32 Correct 138 ms 14276 KB Output is correct
33 Correct 135 ms 14408 KB Output is correct
34 Correct 143 ms 14304 KB Output is correct
35 Correct 621 ms 19304 KB Output is correct
36 Correct 747 ms 19304 KB Output is correct
37 Correct 666 ms 19356 KB Output is correct
38 Correct 801 ms 19628 KB Output is correct
39 Correct 682 ms 19532 KB Output is correct
40 Correct 852 ms 51476 KB Output is correct
41 Correct 839 ms 57916 KB Output is correct
42 Correct 886 ms 58072 KB Output is correct
43 Execution timed out 1038 ms 58056 KB Time limit exceeded
44 Halted 0 ms 0 KB -