oj.uz

Submission #450502

# Submission time Handle Problem Language Result Execution time Memory
450502 2021-08-03T00:34:27 Z SansPapyrus683 Knapsack (NOI18_knapsack) Java 11
73 / 100
 1000 ms 59652 KB 
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
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++;
        }
        System.out.println(Arrays.stream(best[byWeight.size()]).max().getAsLong());
    }
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 9088 KB Output is correct
2 Correct 103 ms 9124 KB Output is correct
3 Correct 115 ms 10624 KB Output is correct
4 Correct 85 ms 9240 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 9208 KB Output is correct
2 Correct 120 ms 10700 KB Output is correct
3 Correct 126 ms 10572 KB Output is correct
4 Correct 98 ms 9324 KB Output is correct
5 Correct 97 ms 9392 KB Output is correct
6 Correct 130 ms 14264 KB Output is correct
7 Correct 132 ms 14228 KB Output is correct
8 Correct 136 ms 14460 KB Output is correct
9 Correct 132 ms 14448 KB Output is correct
10 Correct 137 ms 14480 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 9208 KB Output is correct
2 Correct 120 ms 10700 KB Output is correct
3 Correct 126 ms 10572 KB Output is correct
4 Correct 98 ms 9324 KB Output is correct
5 Correct 97 ms 9392 KB Output is correct
6 Correct 130 ms 14264 KB Output is correct
7 Correct 132 ms 14228 KB Output is correct
8 Correct 136 ms 14460 KB Output is correct
9 Correct 132 ms 14448 KB Output is correct
10 Correct 137 ms 14480 KB Output is correct
11 Correct 91 ms 9248 KB Output is correct
12 Correct 151 ms 11604 KB Output is correct
13 Correct 120 ms 10820 KB Output is correct
14 Correct 101 ms 9448 KB Output is correct
15 Correct 97 ms 9388 KB Output is correct
16 Correct 155 ms 14708 KB Output is correct
17 Correct 135 ms 14388 KB Output is correct
18 Correct 135 ms 14480 KB Output is correct
19 Correct 144 ms 14440 KB Output is correct
20 Correct 154 ms 14576 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 9088 KB Output is correct
2 Correct 103 ms 9124 KB Output is correct
3 Correct 115 ms 10624 KB Output is correct
4 Correct 85 ms 9240 KB Output is correct
5 Correct 102 ms 9208 KB Output is correct
6 Correct 120 ms 10700 KB Output is correct
7 Correct 126 ms 10572 KB Output is correct
8 Correct 98 ms 9324 KB Output is correct
9 Correct 97 ms 9392 KB Output is correct
10 Correct 130 ms 14264 KB Output is correct
11 Correct 132 ms 14228 KB Output is correct
12 Correct 136 ms 14460 KB Output is correct
13 Correct 132 ms 14448 KB Output is correct
14 Correct 137 ms 14480 KB Output is correct
15 Correct 91 ms 9248 KB Output is correct
16 Correct 151 ms 11604 KB Output is correct
17 Correct 120 ms 10820 KB Output is correct
18 Correct 101 ms 9448 KB Output is correct
19 Correct 97 ms 9388 KB Output is correct
20 Correct 155 ms 14708 KB Output is correct
21 Correct 135 ms 14388 KB Output is correct
22 Correct 135 ms 14480 KB Output is correct
23 Correct 144 ms 14440 KB Output is correct
24 Correct 154 ms 14576 KB Output is correct
25 Correct 93 ms 9168 KB Output is correct
26 Correct 144 ms 10648 KB Output is correct
27 Correct 125 ms 10608 KB Output is correct
28 Correct 101 ms 9428 KB Output is correct
29 Correct 110 ms 9576 KB Output is correct
30 Correct 143 ms 14488 KB Output is correct
31 Correct 139 ms 14364 KB Output is correct
32 Correct 138 ms 14576 KB Output is correct
33 Correct 137 ms 14508 KB Output is correct
34 Correct 140 ms 14388 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 9088 KB Output is correct
2 Correct 103 ms 9124 KB Output is correct
3 Correct 115 ms 10624 KB Output is correct
4 Correct 85 ms 9240 KB Output is correct
5 Correct 102 ms 9208 KB Output is correct
6 Correct 120 ms 10700 KB Output is correct
7 Correct 126 ms 10572 KB Output is correct
8 Correct 98 ms 9324 KB Output is correct
9 Correct 97 ms 9392 KB Output is correct
10 Correct 130 ms 14264 KB Output is correct
11 Correct 132 ms 14228 KB Output is correct
12 Correct 136 ms 14460 KB Output is correct
13 Correct 132 ms 14448 KB Output is correct
14 Correct 137 ms 14480 KB Output is correct
15 Correct 91 ms 9248 KB Output is correct
16 Correct 151 ms 11604 KB Output is correct
17 Correct 120 ms 10820 KB Output is correct
18 Correct 101 ms 9448 KB Output is correct
19 Correct 97 ms 9388 KB Output is correct
20 Correct 155 ms 14708 KB Output is correct
21 Correct 135 ms 14388 KB Output is correct
22 Correct 135 ms 14480 KB Output is correct
23 Correct 144 ms 14440 KB Output is correct
24 Correct 154 ms 14576 KB Output is correct
25 Correct 93 ms 9168 KB Output is correct
26 Correct 144 ms 10648 KB Output is correct
27 Correct 125 ms 10608 KB Output is correct
28 Correct 101 ms 9428 KB Output is correct
29 Correct 110 ms 9576 KB Output is correct
30 Correct 143 ms 14488 KB Output is correct
31 Correct 139 ms 14364 KB Output is correct
32 Correct 138 ms 14576 KB Output is correct
33 Correct 137 ms 14508 KB Output is correct
34 Correct 140 ms 14388 KB Output is correct
35 Correct 641 ms 19520 KB Output is correct
36 Correct 687 ms 19256 KB Output is correct
37 Correct 666 ms 20580 KB Output is correct
38 Correct 762 ms 20968 KB Output is correct
39 Correct 646 ms 22100 KB Output is correct
40 Correct 873 ms 53876 KB Output is correct
41 Correct 815 ms 59636 KB Output is correct
42 Correct 869 ms 59652 KB Output is correct
43 Correct 938 ms 59544 KB Output is correct
44 Execution timed out 1004 ms 59548 KB Time limit exceeded
45 Halted 0 ms 0 KB -