oj.uz

Submission #942490

# Submission time Handle Problem Language Result Execution time Memory
942490 2024-03-10T17:43:41 Z AtabayRajabli Knapsack (NOI18_knapsack) C++17
100 / 100
 50 ms 9820 KB 
#include <bits/stdc++.h>

// author : a1abay

#define all(v)      v.begin(), v.end()
#define GCD(a, b)   __gcd(a, b)
#define int         ll 
#define LCM(a, b)   (a*b / (__gcd(a, b)))
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

typedef long long           ll;
const int inf =             1e9 + 7;
const int inff =            (int)1e18 + 7;
const int sz =              1e5 + 5;
using namespace             std;

int s, n;
int v[sz], w[sz], f[sz], dp[sz];
vector<array<int, 2>> g[sz];

signed main()   
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    // freopen("in.in", "r", stdin); freopen("out.out", "w", stdout);
    
    cin >> s >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> v[i] >> w[i] >> f[i];
        g[w[i]].push_back({v[i], f[i]});
    }
    for(int i = 1; i <= s; i++)
    {
        sort(all(g[i]));
        
        int mx = s / i, last = -1;
        while(!g[i].empty())
        {
            int x = g[i].back()[1], v = g[i].back()[0];
            if(mx - x >= 0)
            {
                mx -= x;
                g[i].pop_back();
            }
            else 
            {
                last = v;
                break;
            }
            for(int j = 1; j <= x; j++)
            {
                for(int k = s; k >= i; k--)
                {
                    dp[k] = max(dp[k - i] + v, dp[k]);
                }
            }
        }
        for(int j = 1; j <= mx; j++)
        {
            for(int k = s; k >= i; k--)
            {
                dp[k] = max(dp[k - i] + last, dp[k]);
            }
        }
        
    }
    int mx = -1;
    for(int i = 0; i <= s; i++)mx = max(mx, dp[i]);
    
    cout << mx;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4700 KB Output is correct
2 Correct 8 ms 4700 KB Output is correct
3 Correct 8 ms 4700 KB Output is correct
4 Correct 8 ms 4700 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 21 ms 4700 KB Output is correct
3 Correct 24 ms 4752 KB Output is correct
4 Correct 20 ms 4700 KB Output is correct
5 Correct 21 ms 4700 KB Output is correct
6 Correct 21 ms 4700 KB Output is correct
7 Correct 23 ms 4700 KB Output is correct
8 Correct 21 ms 4700 KB Output is correct
9 Correct 21 ms 4748 KB Output is correct
10 Correct 21 ms 4700 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 21 ms 4700 KB Output is correct
3 Correct 24 ms 4752 KB Output is correct
4 Correct 20 ms 4700 KB Output is correct
5 Correct 21 ms 4700 KB Output is correct
6 Correct 21 ms 4700 KB Output is correct
7 Correct 23 ms 4700 KB Output is correct
8 Correct 21 ms 4700 KB Output is correct
9 Correct 21 ms 4748 KB Output is correct
10 Correct 21 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 21 ms 4700 KB Output is correct
13 Correct 21 ms 4752 KB Output is correct
14 Correct 23 ms 4696 KB Output is correct
15 Correct 21 ms 4700 KB Output is correct
16 Correct 21 ms 4744 KB Output is correct
17 Correct 21 ms 4700 KB Output is correct
18 Correct 22 ms 4724 KB Output is correct
19 Correct 21 ms 4696 KB Output is correct
20 Correct 21 ms 4696 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4700 KB Output is correct
2 Correct 8 ms 4700 KB Output is correct
3 Correct 8 ms 4700 KB Output is correct
4 Correct 8 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 21 ms 4700 KB Output is correct
7 Correct 24 ms 4752 KB Output is correct
8 Correct 20 ms 4700 KB Output is correct
9 Correct 21 ms 4700 KB Output is correct
10 Correct 21 ms 4700 KB Output is correct
11 Correct 23 ms 4700 KB Output is correct
12 Correct 21 ms 4700 KB Output is correct
13 Correct 21 ms 4748 KB Output is correct
14 Correct 21 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 21 ms 4700 KB Output is correct
17 Correct 21 ms 4752 KB Output is correct
18 Correct 23 ms 4696 KB Output is correct
19 Correct 21 ms 4700 KB Output is correct
20 Correct 21 ms 4744 KB Output is correct
21 Correct 21 ms 4700 KB Output is correct
22 Correct 22 ms 4724 KB Output is correct
23 Correct 21 ms 4696 KB Output is correct
24 Correct 21 ms 4696 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 23 ms 4700 KB Output is correct
27 Correct 23 ms 4744 KB Output is correct
28 Correct 23 ms 4748 KB Output is correct
29 Correct 21 ms 4700 KB Output is correct
30 Correct 21 ms 4700 KB Output is correct
31 Correct 21 ms 4744 KB Output is correct
32 Correct 21 ms 4700 KB Output is correct
33 Correct 21 ms 4700 KB Output is correct
34 Correct 21 ms 4748 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4700 KB Output is correct
2 Correct 8 ms 4700 KB Output is correct
3 Correct 8 ms 4700 KB Output is correct
4 Correct 8 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 21 ms 4700 KB Output is correct
7 Correct 24 ms 4752 KB Output is correct
8 Correct 20 ms 4700 KB Output is correct
9 Correct 21 ms 4700 KB Output is correct
10 Correct 21 ms 4700 KB Output is correct
11 Correct 23 ms 4700 KB Output is correct
12 Correct 21 ms 4700 KB Output is correct
13 Correct 21 ms 4748 KB Output is correct
14 Correct 21 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 21 ms 4700 KB Output is correct
17 Correct 21 ms 4752 KB Output is correct
18 Correct 23 ms 4696 KB Output is correct
19 Correct 21 ms 4700 KB Output is correct
20 Correct 21 ms 4744 KB Output is correct
21 Correct 21 ms 4700 KB Output is correct
22 Correct 22 ms 4724 KB Output is correct
23 Correct 21 ms 4696 KB Output is correct
24 Correct 21 ms 4696 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 23 ms 4700 KB Output is correct
27 Correct 23 ms 4744 KB Output is correct
28 Correct 23 ms 4748 KB Output is correct
29 Correct 21 ms 4700 KB Output is correct
30 Correct 21 ms 4700 KB Output is correct
31 Correct 21 ms 4744 KB Output is correct
32 Correct 21 ms 4700 KB Output is correct
33 Correct 21 ms 4700 KB Output is correct
34 Correct 21 ms 4748 KB Output is correct
35 Correct 24 ms 7632 KB Output is correct
36 Correct 46 ms 7636 KB Output is correct
37 Correct 47 ms 7636 KB Output is correct
38 Correct 45 ms 8884 KB Output is correct
39 Correct 48 ms 9216 KB Output is correct
40 Correct 46 ms 9800 KB Output is correct
41 Correct 42 ms 9052 KB Output is correct
42 Correct 45 ms 9296 KB Output is correct
43 Correct 41 ms 9328 KB Output is correct
44 Correct 42 ms 9160 KB Output is correct
45 Correct 46 ms 9612 KB Output is correct
46 Correct 50 ms 8916 KB Output is correct
47 Correct 45 ms 9820 KB Output is correct
48 Correct 49 ms 9708 KB Output is correct
49 Correct 47 ms 9296 KB Output is correct
50 Correct 45 ms 9048 KB Output is correct