oj.uz

Submission #500292

# Submission time Handle Problem Language Result Execution time Memory
500292 2021-12-30T15:55:42 Z MohamedFaresNebili Knapsack (NOI18_knapsack) C++14
100 / 100
 88 ms 38480 KB 
#include <bits/stdc++.h>

        using namespace std;

        using ll = long long;
        using ii = pair<ll, ll>;
        using vi = vector<ll>;

        #define ff first
        #define ss second
        #define pb push_back
        #define all(x) x.begin(), x.end()
        #define lb lower_bound
        #define ub upper_bound

        ll s, n; ll v[2 * 100005], w[2 * 100005], k[2 * 100005];
        vector<ii> arr[2005]; ll dp[2005][2005];

        int32_t main()
        {
            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
            cin >> s >> n;
            for(ll l = 0; l < n; l++) {
                cin >> v[l] >> w[l] >> k[l];
                arr[w[l]].pb({v[l], k[l]});
            }
            int last = 0; ll res = 0;
            for(int l = 1; l <= s; l++) {
                if(!(int)arr[l].size()) continue;
                sort(all(arr[l]), greater<ii>());
                for(int i = 0; i <= s; i++) {
                    dp[l][i] = dp[last][i];
                    ll curr = 0, ind = 0, profit = 0;
                    for(int j = 1, k = 0; j <= i; j++, k++) {
                        if(k == arr[l][ind].ss) k = 0, ind++;
                        profit += arr[l][ind].ff;
                        if(j * l > i || ind == (int)arr[l].size()) break;
                        dp[l][i] = max(dp[l][i], dp[last][i - j * l] + profit);
                    }
                    res = max(res, dp[l][i]);
                }
                last = l;
            }
            cout << res << "\n";
            return 0;
        }

Compilation message

knapsack.cpp: In function 'int32_t main()':
knapsack.cpp:33:24: warning: unused variable 'curr' [-Wunused-variable]
   33 |                     ll curr = 0, ind = 0, profit = 0;
      |                        ^~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 2 ms 2252 KB Output is correct
7 Correct 2 ms 2252 KB Output is correct
8 Correct 3 ms 2252 KB Output is correct
9 Correct 2 ms 2252 KB Output is correct
10 Correct 2 ms 2148 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 2 ms 2252 KB Output is correct
7 Correct 2 ms 2252 KB Output is correct
8 Correct 3 ms 2252 KB Output is correct
9 Correct 2 ms 2252 KB Output is correct
10 Correct 2 ms 2148 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 460 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 2 ms 2252 KB Output is correct
17 Correct 2 ms 2156 KB Output is correct
18 Correct 2 ms 2252 KB Output is correct
19 Correct 2 ms 2252 KB Output is correct
20 Correct 2 ms 2252 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 2 ms 2252 KB Output is correct
11 Correct 2 ms 2252 KB Output is correct
12 Correct 3 ms 2252 KB Output is correct
13 Correct 2 ms 2252 KB Output is correct
14 Correct 2 ms 2148 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 2 ms 2252 KB Output is correct
21 Correct 2 ms 2156 KB Output is correct
22 Correct 2 ms 2252 KB Output is correct
23 Correct 2 ms 2252 KB Output is correct
24 Correct 2 ms 2252 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 3 ms 2252 KB Output is correct
31 Correct 2 ms 2252 KB Output is correct
32 Correct 2 ms 2252 KB Output is correct
33 Correct 2 ms 2252 KB Output is correct
34 Correct 2 ms 2252 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 2 ms 2252 KB Output is correct
11 Correct 2 ms 2252 KB Output is correct
12 Correct 3 ms 2252 KB Output is correct
13 Correct 2 ms 2252 KB Output is correct
14 Correct 2 ms 2148 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 2 ms 2252 KB Output is correct
21 Correct 2 ms 2156 KB Output is correct
22 Correct 2 ms 2252 KB Output is correct
23 Correct 2 ms 2252 KB Output is correct
24 Correct 2 ms 2252 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 3 ms 2252 KB Output is correct
31 Correct 2 ms 2252 KB Output is correct
32 Correct 2 ms 2252 KB Output is correct
33 Correct 2 ms 2252 KB Output is correct
34 Correct 2 ms 2252 KB Output is correct
35 Correct 25 ms 4396 KB Output is correct
36 Correct 32 ms 4420 KB Output is correct
37 Correct 32 ms 5428 KB Output is correct
38 Correct 28 ms 6120 KB Output is correct
39 Correct 35 ms 6764 KB Output is correct
40 Correct 88 ms 38480 KB Output is correct
41 Correct 70 ms 37720 KB Output is correct
42 Correct 67 ms 37636 KB Output is correct
43 Correct 81 ms 37668 KB Output is correct
44 Correct 80 ms 37612 KB Output is correct
45 Correct 38 ms 11204 KB Output is correct
46 Correct 34 ms 6376 KB Output is correct
47 Correct 43 ms 15320 KB Output is correct
48 Correct 61 ms 26692 KB Output is correct
49 Correct 31 ms 7440 KB Output is correct
50 Correct 51 ms 7364 KB Output is correct