Submission #521554

# Submission time Handle Problem Language Result Execution time Memory
521554 2022-02-02T11:42:07 Z AmirElarbi Knapsack (NOI18_knapsack) C++14
100 / 100
90 ms 34960 KB
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll unsigned long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e9
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9+7;
const int nax = 2005;
ll dp[nax][nax];
vii w[nax];
int main(){ 
    optimise;
    int n,s;
    cin >> s >> n;
    for (int i = 0; i < n; ++i)
    {
        int a,b,c;
        cin >> a >> b >> c;
        w[b].pb({a,c});
    }
    dp[0][0] = 0;
    int cnt = 1;
    for (int i = 0; i <= s; ++i)
    {
        if(w[i].size()!=0){
            sort(w[i].begin(), w[i].end(), greater<ii>());
            for (int j = 0; j <= s; ++j)
            {
                dp[cnt][j] = dp[cnt-1][j];
                int c = 0,curi = 0,smv = 0,cusd = 0;
                while(((c+1)*i) <= j && curi < w[i].size()){
                    c++,
                    smv += w[i][curi].fi;
                    dp[cnt][j] = max(dp[cnt][j],dp[cnt-1][j-c*i]+smv);
                    cusd++;
                    if(cusd == w[i][curi].se){
                        curi++;
                        cusd = 0;
                    }
                }
            }
            cnt++;
        }
    }
    ll mx = 0;
    for (int j = 0; j <= s; ++j)
    {
        mx = max(mx,dp[cnt-1][j]);
    }
    cout << mx << endl;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:46:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |                 while(((c+1)*i) <= j && curi < w[i].size()){
      |                                         ~~~~~^~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 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 372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 1740 KB Output is correct
7 Correct 2 ms 1868 KB Output is correct
8 Correct 2 ms 1740 KB Output is correct
9 Correct 2 ms 1868 KB Output is correct
10 Correct 2 ms 1776 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 1740 KB Output is correct
7 Correct 2 ms 1868 KB Output is correct
8 Correct 2 ms 1740 KB Output is correct
9 Correct 2 ms 1868 KB Output is correct
10 Correct 2 ms 1776 KB Output is correct
11 Correct 1 ms 368 KB Output is correct
12 Correct 5 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 1868 KB Output is correct
17 Correct 2 ms 1780 KB Output is correct
18 Correct 2 ms 1868 KB Output is correct
19 Correct 2 ms 1868 KB Output is correct
20 Correct 2 ms 1896 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 372 KB Output is correct
5 Correct 1 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 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 2 ms 1740 KB Output is correct
13 Correct 2 ms 1868 KB Output is correct
14 Correct 2 ms 1776 KB Output is correct
15 Correct 1 ms 368 KB Output is correct
16 Correct 5 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 1868 KB Output is correct
21 Correct 2 ms 1780 KB Output is correct
22 Correct 2 ms 1868 KB Output is correct
23 Correct 2 ms 1868 KB Output is correct
24 Correct 2 ms 1896 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 6 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 1868 KB Output is correct
31 Correct 2 ms 1868 KB Output is correct
32 Correct 2 ms 1868 KB Output is correct
33 Correct 2 ms 1868 KB Output is correct
34 Correct 2 ms 1868 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 372 KB Output is correct
5 Correct 1 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 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct
11 Correct 2 ms 1868 KB Output is correct
12 Correct 2 ms 1740 KB Output is correct
13 Correct 2 ms 1868 KB Output is correct
14 Correct 2 ms 1776 KB Output is correct
15 Correct 1 ms 368 KB Output is correct
16 Correct 5 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 1868 KB Output is correct
21 Correct 2 ms 1780 KB Output is correct
22 Correct 2 ms 1868 KB Output is correct
23 Correct 2 ms 1868 KB Output is correct
24 Correct 2 ms 1896 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 6 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 1868 KB Output is correct
31 Correct 2 ms 1868 KB Output is correct
32 Correct 2 ms 1868 KB Output is correct
33 Correct 2 ms 1868 KB Output is correct
34 Correct 2 ms 1868 KB Output is correct
35 Correct 31 ms 2380 KB Output is correct
36 Correct 35 ms 2564 KB Output is correct
37 Correct 32 ms 2328 KB Output is correct
38 Correct 28 ms 2712 KB Output is correct
39 Correct 34 ms 3476 KB Output is correct
40 Correct 90 ms 34960 KB Output is correct
41 Correct 84 ms 34196 KB Output is correct
42 Correct 71 ms 34204 KB Output is correct
43 Correct 81 ms 34232 KB Output is correct
44 Correct 83 ms 34116 KB Output is correct
45 Correct 43 ms 6808 KB Output is correct
46 Correct 32 ms 3228 KB Output is correct
47 Correct 49 ms 10000 KB Output is correct
48 Correct 60 ms 19204 KB Output is correct
49 Correct 31 ms 4044 KB Output is correct
50 Correct 60 ms 4164 KB Output is correct