oj.uz

Submission #531246

# Submission time Handle Problem Language Result Execution time Memory
531246 2022-02-28T08:39:27 Z Netr Knapsack (NOI18_knapsack) C++14
100 / 100
 485 ms 17504 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pi;

#ifdef DEBUG
#define D(x...) printf(x);
#else
#define D(x...)
#endif

const int MAXS = 2005;
const int INF = 1<<30;

int S, N, dp[MAXS][MAXS];
vector<pi> items[MAXS];

int prefSum(int w, int k){
    
    int cnt = 0, val = 0;
    for(int i = items[w].size()-1; i >= 0; i--){
        if(cnt + items[w][i].second > k){
            val += (k - cnt) * items[w][i].first;
            cnt = k;
            break;
        }else{
            val += items[w][i].first * items[w][i].second;
            cnt += items[w][i].second;
        }
    }
    D("pS: %d, %d, val = %d\n", w, k, val);
    return val;
}

int solve(int w, int i){
    D("Solve: %d, %d\n", w, i);
    if(dp[w][i] > 0) return dp[w][i];
    if(w < 0) return -INF;
    if(i == 1) return prefSum(i, w);

    int res = solve(w, i-1);
    if(!items[i].empty()){
        for(int k = 1; k <= w/i; k++){
            res = max(res, prefSum(i,k) + solve(w-k*i, i-1));
        }
    }
    dp[w][i] = res;
    return res;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> S >> N;
    for(int i = 0; i < N; i++){
        int vi, wi, ki;
        cin >> vi >> wi >> ki;
        items[wi].push_back({vi, ki});
    }
    for(int i = 0; i < MAXS; i++){
        sort(begin(items[i]), end(items[i]));
    }
    dp[S][S] = 0;
    cout << solve(S, S) << "\n";
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 496 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 364 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 29 ms 10688 KB Output is correct
7 Correct 29 ms 10988 KB Output is correct
8 Correct 29 ms 10868 KB Output is correct
9 Correct 23 ms 10820 KB Output is correct
10 Correct 32 ms 11040 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 29 ms 10688 KB Output is correct
7 Correct 29 ms 10988 KB Output is correct
8 Correct 29 ms 10868 KB Output is correct
9 Correct 23 ms 10820 KB Output is correct
10 Correct 32 ms 11040 KB Output is correct
11 Correct 0 ms 368 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 504 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 18 ms 11140 KB Output is correct
17 Correct 28 ms 10872 KB Output is correct
18 Correct 41 ms 10836 KB Output is correct
19 Correct 31 ms 11204 KB Output is correct
20 Correct 27 ms 10452 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 496 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 29 ms 10688 KB Output is correct
11 Correct 29 ms 10988 KB Output is correct
12 Correct 29 ms 10868 KB Output is correct
13 Correct 23 ms 10820 KB Output is correct
14 Correct 32 ms 11040 KB Output is correct
15 Correct 0 ms 368 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 504 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 18 ms 11140 KB Output is correct
21 Correct 28 ms 10872 KB Output is correct
22 Correct 41 ms 10836 KB Output is correct
23 Correct 31 ms 11204 KB Output is correct
24 Correct 27 ms 10452 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 496 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 588 KB Output is correct
29 Correct 1 ms 504 KB Output is correct
30 Correct 32 ms 11128 KB Output is correct
31 Correct 29 ms 11032 KB Output is correct
32 Correct 44 ms 10124 KB Output is correct
33 Correct 28 ms 10628 KB Output is correct
34 Correct 33 ms 10404 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 496 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 29 ms 10688 KB Output is correct
11 Correct 29 ms 10988 KB Output is correct
12 Correct 29 ms 10868 KB Output is correct
13 Correct 23 ms 10820 KB Output is correct
14 Correct 32 ms 11040 KB Output is correct
15 Correct 0 ms 368 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 504 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 18 ms 11140 KB Output is correct
21 Correct 28 ms 10872 KB Output is correct
22 Correct 41 ms 10836 KB Output is correct
23 Correct 31 ms 11204 KB Output is correct
24 Correct 27 ms 10452 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 496 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 588 KB Output is correct
29 Correct 1 ms 504 KB Output is correct
30 Correct 32 ms 11128 KB Output is correct
31 Correct 29 ms 11032 KB Output is correct
32 Correct 44 ms 10124 KB Output is correct
33 Correct 28 ms 10628 KB Output is correct
34 Correct 33 ms 10404 KB Output is correct
35 Correct 27 ms 2352 KB Output is correct
36 Correct 29 ms 2752 KB Output is correct
37 Correct 36 ms 2440 KB Output is correct
38 Correct 30 ms 2872 KB Output is correct
39 Correct 35 ms 3596 KB Output is correct
40 Correct 159 ms 17504 KB Output is correct
41 Correct 485 ms 16760 KB Output is correct
42 Correct 481 ms 16808 KB Output is correct
43 Correct 176 ms 16748 KB Output is correct
44 Correct 167 ms 16808 KB Output is correct
45 Correct 58 ms 12356 KB Output is correct
46 Correct 32 ms 3372 KB Output is correct
47 Correct 61 ms 13004 KB Output is correct
48 Correct 89 ms 11560 KB Output is correct
49 Correct 40 ms 4568 KB Output is correct
50 Correct 92 ms 11884 KB Output is correct