oj.uz

Submission #654375

# Submission time Handle Problem Language Result Execution time Memory
654375 2022-10-31T08:10:40 Z Nafeeszx Knapsack (NOI18_knapsack) C++14
100 / 100
 73 ms 19420 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define trav(a, x) for(auto& a : x)
#define FOR(i, a, b) for (int i=(a); i<=(signed)(b); i++)
#define ROF(i, a, b) for (int i=(a); i>=(signed)(b); i--)
#define F0R(i, a) for (int i=0; i<(signed)(a); i++)
#define vi vector<int>
#define all(v) (v).begin(), (v).end()
#define f first
#define s second
typedef long long ll;

const int mod = 1e9 + 7, MOD = 998244353;

vector<pair<int, int>> wt[2005];
vector<int> sortwt[2005];
int dp[2005][2005];

int main()
{	
    ios_base::sync_with_stdio(0); cin.tie(0);
    memset(dp, -1e9-15, sizeof(dp));
    int s, n; cin >> s >> n;
    F0R(i, n) {
        int k, w, v; cin >> v >> w >> k;
        wt[w].push_back(make_pair(v, k));
    }
    FOR(i, 1, s) sort(wt[i].rbegin(), wt[i].rend());
    FOR(i, 1, s) {
        int wwt = 0, vvs = 0;
        int j = 0;
        while(wwt <= s && j < wt[i].size()) {
            wwt+=i;
            vvs += wt[i][j].first; 
            sortwt[i].push_back(vvs);
            wt[i][j].second--;
            if(wt[i][j].second == 0) j++; 
        }
    }
    //trav(u, sortwt[1]) cout << u << " ";
    
    dp[0][0] = 0;
    FOR(i, 1, s) {
        F0R(j, sortwt[i].size()) {
            FOR(k, 0, s) {
                if(k - i * (j+1) >= 0) dp[i][k] = max(dp[i][k], dp[i-1][k - i * (j+1)] + sortwt[i][j]);
            }
        }
        FOR(k, 0, s) {
            dp[i][k] = max(dp[i][k], dp[i-1][k]);
        }
    }
    int res = 0;
    FOR(i, 0, s) {FOR(j, 0, s) res = max(res, dp[i][j]);}
    cout << res;
    return 0;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:34:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         while(wwt <= s && j < wt[i].size()) {
      |                           ~~^~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16084 KB Output is correct
2 Correct 10 ms 16156 KB Output is correct
3 Correct 9 ms 16084 KB Output is correct
4 Correct 8 ms 16152 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 11 ms 16116 KB Output is correct
3 Correct 11 ms 16156 KB Output is correct
4 Correct 11 ms 16152 KB Output is correct
5 Correct 11 ms 16148 KB Output is correct
6 Correct 12 ms 16196 KB Output is correct
7 Correct 11 ms 16152 KB Output is correct
8 Correct 12 ms 16160 KB Output is correct
9 Correct 11 ms 16084 KB Output is correct
10 Correct 10 ms 16084 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16084 KB Output is correct
2 Correct 11 ms 16116 KB Output is correct
3 Correct 11 ms 16156 KB Output is correct
4 Correct 11 ms 16152 KB Output is correct
5 Correct 11 ms 16148 KB Output is correct
6 Correct 12 ms 16196 KB Output is correct
7 Correct 11 ms 16152 KB Output is correct
8 Correct 12 ms 16160 KB Output is correct
9 Correct 11 ms 16084 KB Output is correct
10 Correct 10 ms 16084 KB Output is correct
11 Correct 7 ms 16192 KB Output is correct
12 Correct 13 ms 16156 KB Output is correct
13 Correct 11 ms 16084 KB Output is correct
14 Correct 10 ms 16148 KB Output is correct
15 Correct 11 ms 16068 KB Output is correct
16 Correct 12 ms 16084 KB Output is correct
17 Correct 11 ms 16084 KB Output is correct
18 Correct 11 ms 16084 KB Output is correct
19 Correct 11 ms 16152 KB Output is correct
20 Correct 12 ms 16084 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16084 KB Output is correct
2 Correct 10 ms 16156 KB Output is correct
3 Correct 9 ms 16084 KB Output is correct
4 Correct 8 ms 16152 KB Output is correct
5 Correct 7 ms 16084 KB Output is correct
6 Correct 11 ms 16116 KB Output is correct
7 Correct 11 ms 16156 KB Output is correct
8 Correct 11 ms 16152 KB Output is correct
9 Correct 11 ms 16148 KB Output is correct
10 Correct 12 ms 16196 KB Output is correct
11 Correct 11 ms 16152 KB Output is correct
12 Correct 12 ms 16160 KB Output is correct
13 Correct 11 ms 16084 KB Output is correct
14 Correct 10 ms 16084 KB Output is correct
15 Correct 7 ms 16192 KB Output is correct
16 Correct 13 ms 16156 KB Output is correct
17 Correct 11 ms 16084 KB Output is correct
18 Correct 10 ms 16148 KB Output is correct
19 Correct 11 ms 16068 KB Output is correct
20 Correct 12 ms 16084 KB Output is correct
21 Correct 11 ms 16084 KB Output is correct
22 Correct 11 ms 16084 KB Output is correct
23 Correct 11 ms 16152 KB Output is correct
24 Correct 12 ms 16084 KB Output is correct
25 Correct 7 ms 16084 KB Output is correct
26 Correct 14 ms 16152 KB Output is correct
27 Correct 12 ms 16152 KB Output is correct
28 Correct 10 ms 16084 KB Output is correct
29 Correct 11 ms 16084 KB Output is correct
30 Correct 12 ms 16148 KB Output is correct
31 Correct 11 ms 16084 KB Output is correct
32 Correct 11 ms 16084 KB Output is correct
33 Correct 12 ms 16160 KB Output is correct
34 Correct 11 ms 16060 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16084 KB Output is correct
2 Correct 10 ms 16156 KB Output is correct
3 Correct 9 ms 16084 KB Output is correct
4 Correct 8 ms 16152 KB Output is correct
5 Correct 7 ms 16084 KB Output is correct
6 Correct 11 ms 16116 KB Output is correct
7 Correct 11 ms 16156 KB Output is correct
8 Correct 11 ms 16152 KB Output is correct
9 Correct 11 ms 16148 KB Output is correct
10 Correct 12 ms 16196 KB Output is correct
11 Correct 11 ms 16152 KB Output is correct
12 Correct 12 ms 16160 KB Output is correct
13 Correct 11 ms 16084 KB Output is correct
14 Correct 10 ms 16084 KB Output is correct
15 Correct 7 ms 16192 KB Output is correct
16 Correct 13 ms 16156 KB Output is correct
17 Correct 11 ms 16084 KB Output is correct
18 Correct 10 ms 16148 KB Output is correct
19 Correct 11 ms 16068 KB Output is correct
20 Correct 12 ms 16084 KB Output is correct
21 Correct 11 ms 16084 KB Output is correct
22 Correct 11 ms 16084 KB Output is correct
23 Correct 11 ms 16152 KB Output is correct
24 Correct 12 ms 16084 KB Output is correct
25 Correct 7 ms 16084 KB Output is correct
26 Correct 14 ms 16152 KB Output is correct
27 Correct 12 ms 16152 KB Output is correct
28 Correct 10 ms 16084 KB Output is correct
29 Correct 11 ms 16084 KB Output is correct
30 Correct 12 ms 16148 KB Output is correct
31 Correct 11 ms 16084 KB Output is correct
32 Correct 11 ms 16084 KB Output is correct
33 Correct 12 ms 16160 KB Output is correct
34 Correct 11 ms 16060 KB Output is correct
35 Correct 33 ms 18084 KB Output is correct
36 Correct 39 ms 18256 KB Output is correct
37 Correct 41 ms 18084 KB Output is correct
38 Correct 40 ms 18404 KB Output is correct
39 Correct 46 ms 19112 KB Output is correct
40 Correct 73 ms 19380 KB Output is correct
41 Correct 50 ms 18592 KB Output is correct
42 Correct 51 ms 18576 KB Output is correct
43 Correct 58 ms 18700 KB Output is correct
44 Correct 58 ms 18636 KB Output is correct
45 Correct 48 ms 19420 KB Output is correct
46 Correct 45 ms 18992 KB Output is correct
47 Correct 49 ms 19404 KB Output is correct
48 Correct 55 ms 19320 KB Output is correct
49 Correct 41 ms 19172 KB Output is correct
50 Correct 53 ms 19112 KB Output is correct