oj.uz

Submission #976991

# Submission time Handle Problem Language Result Execution time Memory
976991 2024-05-07T10:07:46 Z kfhjad Knapsack (NOI18_knapsack) C++17
73 / 100
 1000 ms 39348 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)
    {
        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];

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

                if (at == dp[j][addWeight][0])
                    ++dp[i][addWeight][1];
                else
                    dp[i][addWeight][0] = at, dp[i][addWeight][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 13 ms 20824 KB Output is correct
2 Correct 7 ms 20828 KB Output is correct
3 Correct 6 ms 21084 KB Output is correct
4 Correct 6 ms 20944 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 16 ms 31768 KB Output is correct
3 Correct 15 ms 31580 KB Output is correct
4 Correct 13 ms 31380 KB Output is correct
5 Correct 12 ms 31324 KB Output is correct
6 Correct 57 ms 31804 KB Output is correct
7 Correct 67 ms 31952 KB Output is correct
8 Correct 46 ms 31580 KB Output is correct
9 Correct 53 ms 31580 KB Output is correct
10 Correct 60 ms 31576 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 16 ms 31768 KB Output is correct
3 Correct 15 ms 31580 KB Output is correct
4 Correct 13 ms 31380 KB Output is correct
5 Correct 12 ms 31324 KB Output is correct
6 Correct 57 ms 31804 KB Output is correct
7 Correct 67 ms 31952 KB Output is correct
8 Correct 46 ms 31580 KB Output is correct
9 Correct 53 ms 31580 KB Output is correct
10 Correct 60 ms 31576 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 16 ms 31764 KB Output is correct
13 Correct 15 ms 31576 KB Output is correct
14 Correct 13 ms 31324 KB Output is correct
15 Correct 13 ms 31576 KB Output is correct
16 Correct 84 ms 31808 KB Output is correct
17 Correct 48 ms 31576 KB Output is correct
18 Correct 70 ms 31580 KB Output is correct
19 Correct 105 ms 31576 KB Output is correct
20 Correct 87 ms 31576 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 20824 KB Output is correct
2 Correct 7 ms 20828 KB Output is correct
3 Correct 6 ms 21084 KB Output is correct
4 Correct 6 ms 20944 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 16 ms 31768 KB Output is correct
7 Correct 15 ms 31580 KB Output is correct
8 Correct 13 ms 31380 KB Output is correct
9 Correct 12 ms 31324 KB Output is correct
10 Correct 57 ms 31804 KB Output is correct
11 Correct 67 ms 31952 KB Output is correct
12 Correct 46 ms 31580 KB Output is correct
13 Correct 53 ms 31580 KB Output is correct
14 Correct 60 ms 31576 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 16 ms 31764 KB Output is correct
17 Correct 15 ms 31576 KB Output is correct
18 Correct 13 ms 31324 KB Output is correct
19 Correct 13 ms 31576 KB Output is correct
20 Correct 84 ms 31808 KB Output is correct
21 Correct 48 ms 31576 KB Output is correct
22 Correct 70 ms 31580 KB Output is correct
23 Correct 105 ms 31576 KB Output is correct
24 Correct 87 ms 31576 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 14 ms 31580 KB Output is correct
27 Correct 14 ms 31580 KB Output is correct
28 Correct 13 ms 31324 KB Output is correct
29 Correct 13 ms 31324 KB Output is correct
30 Correct 154 ms 31800 KB Output is correct
31 Correct 49 ms 31792 KB Output is correct
32 Correct 60 ms 31576 KB Output is correct
33 Correct 101 ms 31580 KB Output is correct
34 Correct 117 ms 31796 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 20824 KB Output is correct
2 Correct 7 ms 20828 KB Output is correct
3 Correct 6 ms 21084 KB Output is correct
4 Correct 6 ms 20944 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 16 ms 31768 KB Output is correct
7 Correct 15 ms 31580 KB Output is correct
8 Correct 13 ms 31380 KB Output is correct
9 Correct 12 ms 31324 KB Output is correct
10 Correct 57 ms 31804 KB Output is correct
11 Correct 67 ms 31952 KB Output is correct
12 Correct 46 ms 31580 KB Output is correct
13 Correct 53 ms 31580 KB Output is correct
14 Correct 60 ms 31576 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 16 ms 31764 KB Output is correct
17 Correct 15 ms 31576 KB Output is correct
18 Correct 13 ms 31324 KB Output is correct
19 Correct 13 ms 31576 KB Output is correct
20 Correct 84 ms 31808 KB Output is correct
21 Correct 48 ms 31576 KB Output is correct
22 Correct 70 ms 31580 KB Output is correct
23 Correct 105 ms 31576 KB Output is correct
24 Correct 87 ms 31576 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 14 ms 31580 KB Output is correct
27 Correct 14 ms 31580 KB Output is correct
28 Correct 13 ms 31324 KB Output is correct
29 Correct 13 ms 31324 KB Output is correct
30 Correct 154 ms 31800 KB Output is correct
31 Correct 49 ms 31792 KB Output is correct
32 Correct 60 ms 31576 KB Output is correct
33 Correct 101 ms 31580 KB Output is correct
34 Correct 117 ms 31796 KB Output is correct
35 Correct 35 ms 7216 KB Output is correct
36 Correct 50 ms 38480 KB Output is correct
37 Correct 46 ms 38224 KB Output is correct
38 Correct 44 ms 38224 KB Output is correct
39 Correct 48 ms 39028 KB Output is correct
40 Execution timed out 1042 ms 39348 KB Time limit exceeded
41 Halted 0 ms 0 KB -