oj.uz

Submission #869899

# Submission time Handle Problem Language Result Execution time Memory
869899 2023-11-06T07:21:51 Z chuongdan Knapsack (NOI18_knapsack) C++17
100 / 100
 51 ms 3616 KB 
#include<bits/stdc++.h>
#define N 100000
#define S 2000
#define pb push_back
#define int long long
#define mp make_pair
#define fi first
#define se second
#define rep(i, l, r) for(int i = l; i <= r; i++)

using namespace std;

typedef pair<int,int> ii;

int n, s;
int dp[S+5];
vector<int> val[S+5];
vector<ii> ares;
struct mondo {
    int v, w, k;
} a[N+5];

bool cmp(mondo x, mondo y){
    if (x.w == y.w) return x.v > y.v;
    return x.w < y.w;
}

void solve(){
    cin >> s >> n;
    rep(i, 1, n) {
        cin >> a[i].v >> a[i].w >> a[i].k;
    }
    sort(a+1, a+1+n, cmp);
    rep(i, 1, n) {
//        cout << a[i].v << " " << a[i].w << " " << a[i].k << endl;
    }
    rep(i, 1, n){
        int maxsize = s / a[i].w;
        if (a[i].w > s) continue;
        while (a[i].k && val[a[i].w].size() < maxsize){
            a[i].k--;
            val[a[i].w].pb(a[i].v);
        }
    }
    rep(i, 1, s){
        for(auto x: val[i]){
            ares.pb(mp(i, x));
        }
    }
    int res = 0;
    for(auto x: ares) {
        int w = x.fi, v = x.se;
        for(int i = s; i >= w; i--){
            dp[i] = max(dp[i], dp[i-w] + v);
        }
    }
    rep(i, 0, s) res = max(res, dp[i]);
    cout << res;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    #ifndef ONLINE_JUDGE
//        freopen("bt.in", "r", stdin);
//        freopen("bt.out", "w", stdout);
//    #endif
    solve();
}

Compilation message

knapsack.cpp: In function 'void solve()':
knapsack.cpp:40:45: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   40 |         while (a[i].k && val[a[i].w].size() < maxsize){
      |                          ~~~~~~~~~~~~~~~~~~~^~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 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 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 360 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 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 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 360 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 360 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 3 ms 608 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 600 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 25 ms 2736 KB Output is correct
36 Correct 33 ms 2900 KB Output is correct
37 Correct 28 ms 2900 KB Output is correct
38 Correct 29 ms 2652 KB Output is correct
39 Correct 31 ms 2860 KB Output is correct
40 Correct 51 ms 3364 KB Output is correct
41 Correct 40 ms 3348 KB Output is correct
42 Correct 39 ms 3296 KB Output is correct
43 Correct 47 ms 3408 KB Output is correct
44 Correct 47 ms 3616 KB Output is correct
45 Correct 32 ms 2900 KB Output is correct
46 Correct 23 ms 2648 KB Output is correct
47 Correct 34 ms 2996 KB Output is correct
48 Correct 41 ms 3216 KB Output is correct
49 Correct 25 ms 2652 KB Output is correct
50 Correct 43 ms 3104 KB Output is correct