oj.uz

Submission #456389

# Submission time Handle Problem Language Result Execution time Memory
456389 2021-08-06T15:58:49 Z SansPapyrus683 Knapsack (NOI18_knapsack) Java 11
73 / 100
 1000 ms 58132 KB 
import java.io.*;
import java.util.*;
 
public final class knapsack {
    private static class Item {
        public int value;
        public int amt;
        public Item(int value, int amt) {
            this.value = value;
            this.amt = amt;
        }
    }
    
    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<Item>> 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 Item(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<Item> items = pair.getValue();
            // sort items in reverse order by value
            items.sort(Comparator.comparingInt(i -> -i.value));
            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).value;
                    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).amt) {
                        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 97 ms 8912 KB Output is correct
2 Correct 84 ms 9004 KB Output is correct
3 Correct 120 ms 10284 KB Output is correct
4 Correct 86 ms 8840 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 9020 KB Output is correct
2 Correct 115 ms 10356 KB Output is correct
3 Correct 116 ms 10216 KB Output is correct
4 Correct 92 ms 9192 KB Output is correct
5 Correct 91 ms 9080 KB Output is correct
6 Correct 133 ms 14284 KB Output is correct
7 Correct 135 ms 14324 KB Output is correct
8 Correct 133 ms 14480 KB Output is correct
9 Correct 131 ms 14036 KB Output is correct
10 Correct 127 ms 14340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 9020 KB Output is correct
2 Correct 115 ms 10356 KB Output is correct
3 Correct 116 ms 10216 KB Output is correct
4 Correct 92 ms 9192 KB Output is correct
5 Correct 91 ms 9080 KB Output is correct
6 Correct 133 ms 14284 KB Output is correct
7 Correct 135 ms 14324 KB Output is correct
8 Correct 133 ms 14480 KB Output is correct
9 Correct 131 ms 14036 KB Output is correct
10 Correct 127 ms 14340 KB Output is correct
11 Correct 89 ms 9288 KB Output is correct
12 Correct 171 ms 11212 KB Output is correct
13 Correct 120 ms 10572 KB Output is correct
14 Correct 97 ms 9164 KB Output is correct
15 Correct 98 ms 9168 KB Output is correct
16 Correct 139 ms 14476 KB Output is correct
17 Correct 133 ms 14308 KB Output is correct
18 Correct 135 ms 14292 KB Output is correct
19 Correct 135 ms 14280 KB Output is correct
20 Correct 147 ms 14436 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 8912 KB Output is correct
2 Correct 84 ms 9004 KB Output is correct
3 Correct 120 ms 10284 KB Output is correct
4 Correct 86 ms 8840 KB Output is correct
5 Correct 88 ms 9020 KB Output is correct
6 Correct 115 ms 10356 KB Output is correct
7 Correct 116 ms 10216 KB Output is correct
8 Correct 92 ms 9192 KB Output is correct
9 Correct 91 ms 9080 KB Output is correct
10 Correct 133 ms 14284 KB Output is correct
11 Correct 135 ms 14324 KB Output is correct
12 Correct 133 ms 14480 KB Output is correct
13 Correct 131 ms 14036 KB Output is correct
14 Correct 127 ms 14340 KB Output is correct
15 Correct 89 ms 9288 KB Output is correct
16 Correct 171 ms 11212 KB Output is correct
17 Correct 120 ms 10572 KB Output is correct
18 Correct 97 ms 9164 KB Output is correct
19 Correct 98 ms 9168 KB Output is correct
20 Correct 139 ms 14476 KB Output is correct
21 Correct 133 ms 14308 KB Output is correct
22 Correct 135 ms 14292 KB Output is correct
23 Correct 135 ms 14280 KB Output is correct
24 Correct 147 ms 14436 KB Output is correct
25 Correct 89 ms 9104 KB Output is correct
26 Correct 130 ms 10464 KB Output is correct
27 Correct 114 ms 10384 KB Output is correct
28 Correct 98 ms 9280 KB Output is correct
29 Correct 107 ms 9216 KB Output is correct
30 Correct 138 ms 14520 KB Output is correct
31 Correct 136 ms 14308 KB Output is correct
32 Correct 144 ms 14480 KB Output is correct
33 Correct 135 ms 14472 KB Output is correct
34 Correct 138 ms 14508 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 8912 KB Output is correct
2 Correct 84 ms 9004 KB Output is correct
3 Correct 120 ms 10284 KB Output is correct
4 Correct 86 ms 8840 KB Output is correct
5 Correct 88 ms 9020 KB Output is correct
6 Correct 115 ms 10356 KB Output is correct
7 Correct 116 ms 10216 KB Output is correct
8 Correct 92 ms 9192 KB Output is correct
9 Correct 91 ms 9080 KB Output is correct
10 Correct 133 ms 14284 KB Output is correct
11 Correct 135 ms 14324 KB Output is correct
12 Correct 133 ms 14480 KB Output is correct
13 Correct 131 ms 14036 KB Output is correct
14 Correct 127 ms 14340 KB Output is correct
15 Correct 89 ms 9288 KB Output is correct
16 Correct 171 ms 11212 KB Output is correct
17 Correct 120 ms 10572 KB Output is correct
18 Correct 97 ms 9164 KB Output is correct
19 Correct 98 ms 9168 KB Output is correct
20 Correct 139 ms 14476 KB Output is correct
21 Correct 133 ms 14308 KB Output is correct
22 Correct 135 ms 14292 KB Output is correct
23 Correct 135 ms 14280 KB Output is correct
24 Correct 147 ms 14436 KB Output is correct
25 Correct 89 ms 9104 KB Output is correct
26 Correct 130 ms 10464 KB Output is correct
27 Correct 114 ms 10384 KB Output is correct
28 Correct 98 ms 9280 KB Output is correct
29 Correct 107 ms 9216 KB Output is correct
30 Correct 138 ms 14520 KB Output is correct
31 Correct 136 ms 14308 KB Output is correct
32 Correct 144 ms 14480 KB Output is correct
33 Correct 135 ms 14472 KB Output is correct
34 Correct 138 ms 14508 KB Output is correct
35 Correct 642 ms 19288 KB Output is correct
36 Correct 699 ms 19308 KB Output is correct
37 Correct 657 ms 19312 KB Output is correct
38 Correct 747 ms 19380 KB Output is correct
39 Correct 677 ms 19556 KB Output is correct
40 Correct 846 ms 51400 KB Output is correct
41 Correct 867 ms 58132 KB Output is correct
42 Correct 871 ms 57976 KB Output is correct
43 Correct 956 ms 58048 KB Output is correct
44 Execution timed out 1053 ms 58108 KB Time limit exceeded
45 Halted 0 ms 0 KB -