oj.uz

Submission #472182

# Submission time Handle Problem Language Result Execution time Memory
472182 2021-09-13T09:03:20 Z tphuc2908 Knapsack (NOI18_knapsack) C++14
100 / 100
 177 ms 19396 KB 
#include<bits/stdc++.h>

using namespace std;
#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define repi(i,x,y) for(int i = x; i >= y; --i)
#define ci(x) int x; cin>> x
#define TC(t) ci(t); while(t--)
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define cii(x, y) ci(x); ci(y)
#define ciii(x, y, z) ci(x); ci(y); ci(z)
#define mp make_pair
typedef long long ll;
typedef vector<int> vi;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
const int mod1 = 998244353;
const int pi = 31, pii = 29, piii = 41;
const int inf = 1e9 + 5;
const int block = 330;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};

void readfile(){
    #ifdef ONLINE_JUDGE
    #else
        freopen("text.inp", "r", stdin);
    #endif // ONLINE_JUDGE
//    freopen("feast.in", "r", stdin);
//    freopen("feast.out", "w", stdout);
}

int n, s;
vector<pair<int,int> > a[2005]; // fi -> weight, se -> value
int dp[2005][2005];

void inp(){
    cin >> s >> n;
    rep(i,1,n){
        ciii(v,w,k);
        a[w].pb(mp(k, v));
    }
    rep(i,1,s)
        sort(all(a[i]), [](pair<int,int> &a, pair<int,int> &b){return a.se > b.se;});
}

void process(){
    rep(i,1,s){
        rep(j,1,s){
            int sum = 0, val = 0;
            for(auto t : a[j]){
                rep(times,1,t.fi){
                    sum += j;
                    val += t.se;
                    if(sum > i) break;
                    dp[i][j] = max(dp[i][j], dp[i-sum][j-1] + val);
                }
                if(sum > i) break;
            }
            dp[i][j] = max(dp[i][j], dp[i][j-1]);
        }
    }
    int res = 0;
    rep(i,1,s)
        rep(j,1,s)
            res = max(res, dp[i][j]);
    cout << res;
}

int main() {
    //readfile();
    ios_base::sync_with_stdio(0); cin.tie(0);
//    TC(t){
        inp();
        process();
//    }
    return 0;
}

Compilation message

knapsack.cpp: In function 'void readfile()':
knapsack.cpp:29:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         freopen("text.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 9932 KB Output is correct
2 Correct 14 ms 9932 KB Output is correct
3 Correct 15 ms 9992 KB Output is correct
4 Correct 15 ms 10024 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 36 ms 16012 KB Output is correct
3 Correct 31 ms 16004 KB Output is correct
4 Correct 30 ms 15936 KB Output is correct
5 Correct 32 ms 15992 KB Output is correct
6 Correct 41 ms 16048 KB Output is correct
7 Correct 38 ms 15940 KB Output is correct
8 Correct 35 ms 16028 KB Output is correct
9 Correct 34 ms 15944 KB Output is correct
10 Correct 41 ms 16012 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 36 ms 16012 KB Output is correct
3 Correct 31 ms 16004 KB Output is correct
4 Correct 30 ms 15936 KB Output is correct
5 Correct 32 ms 15992 KB Output is correct
6 Correct 41 ms 16048 KB Output is correct
7 Correct 38 ms 15940 KB Output is correct
8 Correct 35 ms 16028 KB Output is correct
9 Correct 34 ms 15944 KB Output is correct
10 Correct 41 ms 16012 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 35 ms 16036 KB Output is correct
13 Correct 33 ms 15940 KB Output is correct
14 Correct 30 ms 16040 KB Output is correct
15 Correct 31 ms 15940 KB Output is correct
16 Correct 44 ms 16040 KB Output is correct
17 Correct 36 ms 15952 KB Output is correct
18 Correct 36 ms 15940 KB Output is correct
19 Correct 37 ms 15944 KB Output is correct
20 Correct 36 ms 15952 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 9932 KB Output is correct
2 Correct 14 ms 9932 KB Output is correct
3 Correct 15 ms 9992 KB Output is correct
4 Correct 15 ms 10024 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 36 ms 16012 KB Output is correct
7 Correct 31 ms 16004 KB Output is correct
8 Correct 30 ms 15936 KB Output is correct
9 Correct 32 ms 15992 KB Output is correct
10 Correct 41 ms 16048 KB Output is correct
11 Correct 38 ms 15940 KB Output is correct
12 Correct 35 ms 16028 KB Output is correct
13 Correct 34 ms 15944 KB Output is correct
14 Correct 41 ms 16012 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 35 ms 16036 KB Output is correct
17 Correct 33 ms 15940 KB Output is correct
18 Correct 30 ms 16040 KB Output is correct
19 Correct 31 ms 15940 KB Output is correct
20 Correct 44 ms 16040 KB Output is correct
21 Correct 36 ms 15952 KB Output is correct
22 Correct 36 ms 15940 KB Output is correct
23 Correct 37 ms 15944 KB Output is correct
24 Correct 36 ms 15952 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 41 ms 15940 KB Output is correct
27 Correct 31 ms 16068 KB Output is correct
28 Correct 30 ms 15948 KB Output is correct
29 Correct 31 ms 15940 KB Output is correct
30 Correct 41 ms 15944 KB Output is correct
31 Correct 35 ms 15916 KB Output is correct
32 Correct 43 ms 15940 KB Output is correct
33 Correct 35 ms 15928 KB Output is correct
34 Correct 42 ms 15952 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 9932 KB Output is correct
2 Correct 14 ms 9932 KB Output is correct
3 Correct 15 ms 9992 KB Output is correct
4 Correct 15 ms 10024 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 36 ms 16012 KB Output is correct
7 Correct 31 ms 16004 KB Output is correct
8 Correct 30 ms 15936 KB Output is correct
9 Correct 32 ms 15992 KB Output is correct
10 Correct 41 ms 16048 KB Output is correct
11 Correct 38 ms 15940 KB Output is correct
12 Correct 35 ms 16028 KB Output is correct
13 Correct 34 ms 15944 KB Output is correct
14 Correct 41 ms 16012 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 35 ms 16036 KB Output is correct
17 Correct 33 ms 15940 KB Output is correct
18 Correct 30 ms 16040 KB Output is correct
19 Correct 31 ms 15940 KB Output is correct
20 Correct 44 ms 16040 KB Output is correct
21 Correct 36 ms 15952 KB Output is correct
22 Correct 36 ms 15940 KB Output is correct
23 Correct 37 ms 15944 KB Output is correct
24 Correct 36 ms 15952 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 41 ms 15940 KB Output is correct
27 Correct 31 ms 16068 KB Output is correct
28 Correct 30 ms 15948 KB Output is correct
29 Correct 31 ms 15940 KB Output is correct
30 Correct 41 ms 15944 KB Output is correct
31 Correct 35 ms 15916 KB Output is correct
32 Correct 43 ms 15940 KB Output is correct
33 Correct 35 ms 15928 KB Output is correct
34 Correct 42 ms 15952 KB Output is correct
35 Correct 34 ms 2372 KB Output is correct
36 Correct 78 ms 18152 KB Output is correct
37 Correct 80 ms 18016 KB Output is correct
38 Correct 70 ms 18312 KB Output is correct
39 Correct 74 ms 19076 KB Output is correct
40 Correct 167 ms 19284 KB Output is correct
41 Correct 160 ms 18424 KB Output is correct
42 Correct 169 ms 18532 KB Output is correct
43 Correct 166 ms 18472 KB Output is correct
44 Correct 177 ms 18520 KB Output is correct
45 Correct 79 ms 19340 KB Output is correct
46 Correct 67 ms 18864 KB Output is correct
47 Correct 109 ms 19396 KB Output is correct
48 Correct 113 ms 19140 KB Output is correct
49 Correct 78 ms 19028 KB Output is correct
50 Correct 124 ms 18952 KB Output is correct