oj.uz

Submission #977007

# Submission time Handle Problem Language Result Execution time Memory
977007 2024-05-07T10:17:35 Z kfhjad Knapsack (NOI18_knapsack) C++17
100 / 100
 68 ms 39372 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int dp[2002][2002][2]; // at, used copies
int maxVal[2001];

int main()
{
    cin.tie(NULL) -> sync_with_stdio(false);
    int S, N;
    cin >> S >> N;
    vector<vector<int>> v(N, vector<int>(3)); // value, weight, items

    for (auto& i : v)
        cin >> i[0] >> i[1] >> i[2];
    
    sort(v.begin(), v.end(), [](auto& a, auto& b)
    {
        if (a[1] == b[1]) // same weight
            return a[0] > b[0];
        
        return a[1] < b[1];
    });

    int prev = -1;
    for (int i = 0; i < N; ++i)
    {
        if (v[i][1] != prev)
            for (int j = 0; j <= S; ++j)
                dp[j][v[i][1]][0] = i;

        prev = v[i][1];
    }

    int ans = 0;
    for (int i = 1; i <= S; ++i)
    {
        int best = 0;
        int att = 0;

        for (int j = 0; j < i; ++j)
        {
            int addWeight = i - j;
            int at = dp[j][addWeight][0];

            if (v[at][1] != addWeight)
                continue;

            if (v[at][2] == dp[j][addWeight][1])
            {
                if (at + 1 == N || v[at + 1][1] != addWeight)
                    continue;
                
                ++at;
            }
            
            if (maxVal[j] + v[at][0] > maxVal[i])
            {
                maxVal[i] = maxVal[j] + v[at][0];

                best = j;
                att = at;
            }
        }

        for (int a = 0; a <= S; ++a)
            dp[i][a][0] = dp[best][a][0], dp[i][a][1] = dp[best][a][1];

        if (att == dp[best][i - best][0])
            ++dp[i][i - best][1];
        else
            dp[i][i - best][0] = att, dp[i][i - best][1] = 1;

        ans = max(ans, maxVal[i]);
    }

    cout << ans << endl;

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21084 KB Output is correct
2 Correct 9 ms 21004 KB Output is correct
3 Correct 5 ms 21084 KB Output is correct
4 Correct 5 ms 21084 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 17 ms 31764 KB Output is correct
3 Correct 14 ms 31760 KB Output is correct
4 Correct 15 ms 31580 KB Output is correct
5 Correct 15 ms 31580 KB Output is correct
6 Correct 15 ms 31580 KB Output is correct
7 Correct 15 ms 31808 KB Output is correct
8 Correct 15 ms 31580 KB Output is correct
9 Correct 15 ms 31780 KB Output is correct
10 Correct 14 ms 31580 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 17 ms 31764 KB Output is correct
3 Correct 14 ms 31760 KB Output is correct
4 Correct 15 ms 31580 KB Output is correct
5 Correct 15 ms 31580 KB Output is correct
6 Correct 15 ms 31580 KB Output is correct
7 Correct 15 ms 31808 KB Output is correct
8 Correct 15 ms 31580 KB Output is correct
9 Correct 15 ms 31780 KB Output is correct
10 Correct 14 ms 31580 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 14 ms 31764 KB Output is correct
13 Correct 14 ms 31580 KB Output is correct
14 Correct 14 ms 31760 KB Output is correct
15 Correct 14 ms 31576 KB Output is correct
16 Correct 14 ms 31580 KB Output is correct
17 Correct 14 ms 31580 KB Output is correct
18 Correct 16 ms 31788 KB Output is correct
19 Correct 14 ms 31580 KB Output is correct
20 Correct 14 ms 31580 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21084 KB Output is correct
2 Correct 9 ms 21004 KB Output is correct
3 Correct 5 ms 21084 KB Output is correct
4 Correct 5 ms 21084 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 17 ms 31764 KB Output is correct
7 Correct 14 ms 31760 KB Output is correct
8 Correct 15 ms 31580 KB Output is correct
9 Correct 15 ms 31580 KB Output is correct
10 Correct 15 ms 31580 KB Output is correct
11 Correct 15 ms 31808 KB Output is correct
12 Correct 15 ms 31580 KB Output is correct
13 Correct 15 ms 31780 KB Output is correct
14 Correct 14 ms 31580 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 14 ms 31764 KB Output is correct
17 Correct 14 ms 31580 KB Output is correct
18 Correct 14 ms 31760 KB Output is correct
19 Correct 14 ms 31576 KB Output is correct
20 Correct 14 ms 31580 KB Output is correct
21 Correct 14 ms 31580 KB Output is correct
22 Correct 16 ms 31788 KB Output is correct
23 Correct 14 ms 31580 KB Output is correct
24 Correct 14 ms 31580 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 13 ms 31580 KB Output is correct
27 Correct 13 ms 31580 KB Output is correct
28 Correct 14 ms 31580 KB Output is correct
29 Correct 14 ms 31580 KB Output is correct
30 Correct 14 ms 31580 KB Output is correct
31 Correct 15 ms 31580 KB Output is correct
32 Correct 18 ms 31824 KB Output is correct
33 Correct 14 ms 31580 KB Output is correct
34 Correct 13 ms 31580 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 21084 KB Output is correct
2 Correct 9 ms 21004 KB Output is correct
3 Correct 5 ms 21084 KB Output is correct
4 Correct 5 ms 21084 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 17 ms 31764 KB Output is correct
7 Correct 14 ms 31760 KB Output is correct
8 Correct 15 ms 31580 KB Output is correct
9 Correct 15 ms 31580 KB Output is correct
10 Correct 15 ms 31580 KB Output is correct
11 Correct 15 ms 31808 KB Output is correct
12 Correct 15 ms 31580 KB Output is correct
13 Correct 15 ms 31780 KB Output is correct
14 Correct 14 ms 31580 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 14 ms 31764 KB Output is correct
17 Correct 14 ms 31580 KB Output is correct
18 Correct 14 ms 31760 KB Output is correct
19 Correct 14 ms 31576 KB Output is correct
20 Correct 14 ms 31580 KB Output is correct
21 Correct 14 ms 31580 KB Output is correct
22 Correct 16 ms 31788 KB Output is correct
23 Correct 14 ms 31580 KB Output is correct
24 Correct 14 ms 31580 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 13 ms 31580 KB Output is correct
27 Correct 13 ms 31580 KB Output is correct
28 Correct 14 ms 31580 KB Output is correct
29 Correct 14 ms 31580 KB Output is correct
30 Correct 14 ms 31580 KB Output is correct
31 Correct 15 ms 31580 KB Output is correct
32 Correct 18 ms 31824 KB Output is correct
33 Correct 14 ms 31580 KB Output is correct
34 Correct 13 ms 31580 KB Output is correct
35 Correct 31 ms 5724 KB Output is correct
36 Correct 45 ms 37172 KB Output is correct
37 Correct 45 ms 37204 KB Output is correct
38 Correct 46 ms 37228 KB Output is correct
39 Correct 50 ms 37176 KB Output is correct
40 Correct 66 ms 37200 KB Output is correct
41 Correct 66 ms 38584 KB Output is correct
42 Correct 64 ms 38480 KB Output is correct
43 Correct 68 ms 38604 KB Output is correct
44 Correct 66 ms 38472 KB Output is correct
45 Correct 53 ms 39248 KB Output is correct
46 Correct 39 ms 39080 KB Output is correct
47 Correct 57 ms 39368 KB Output is correct
48 Correct 60 ms 39332 KB Output is correct
49 Correct 45 ms 39372 KB Output is correct
50 Correct 49 ms 39076 KB Output is correct