oj.uz

Submission #573149

# Submission time Handle Problem Language Result Execution time Memory
573149 2022-06-06T05:13:15 Z BenyKarimi Knapsack (NOI18_knapsack) C++17
100 / 100
 125 ms 69008 KB 
#include<bits/stdc++.h>

#define For(i, x, n) for(int i = x; i < n; i++)
#define Rof(i, x, n) for(int i = n - 1; i >= x; i--)

#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define F first
#define S second
#define pb push_back
#define po pop_back
#define En endl
#define endl "\n"

#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend();

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<PLL> VPLL;

const int MN = 2e3 + 5;
const int MN2 = 1e5 + 5;
const int MOD = 1e9 + 7;
const int LOG = 20;
const LL INF = 1e18 + 7;

LL s, n, v, maxw;
LL dp[MN][MN], k[MN2], w[MN2];
VLL keep[MN];

int main () {
    IOS;
    cin >> s >> n;

    VPLL forsort;
    For (i, 0, n) {
        cin >> v >> w[i] >> k[i];
        maxw = max(maxw, w[i]);
        forsort.pb({v, i});
    }

    sort(ALL(forsort));
    reverse(ALL(forsort));

    for (PLL it : forsort) {
        For (i, 0, k[it.S]) {
            if (keep[w[it.S]].size() == MN) break;
            keep[w[it.S]].pb(it.F);
        }       
    }

    For (i, 1, maxw + 1) {
        For (j, 1, s + 1) {
            dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);

            LL sum = 0;
            For (x, 0, keep[i].size()) {
                sum += keep[i][x];
                LL jon = (x + 1) * i;
                if (jon > j) break;
                dp[i][j] = max(dp[i][j], dp[i - 1][j - jon] + sum);
            }
        }
    }

    cout << dp[maxw][s] << En;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:3:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define For(i, x, n) for(int i = x; i < n; i++)
......
   63 |             For (x, 0, keep[i].size()) {
      |                  ~~~~~~~~~~~~~~~~~~~~  
knapsack.cpp:63:13: note: in expansion of macro 'For'
   63 |             For (x, 0, keep[i].size()) {
      |             ^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2004 KB Output is correct
2 Correct 11 ms 14036 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 13 ms 17196 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 27 ms 31660 KB Output is correct
5 Correct 27 ms 31660 KB Output is correct
6 Correct 26 ms 31452 KB Output is correct
7 Correct 25 ms 31656 KB Output is correct
8 Correct 26 ms 31476 KB Output is correct
9 Correct 28 ms 31716 KB Output is correct
10 Correct 26 ms 31740 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 27 ms 31660 KB Output is correct
5 Correct 27 ms 31660 KB Output is correct
6 Correct 26 ms 31452 KB Output is correct
7 Correct 25 ms 31656 KB Output is correct
8 Correct 26 ms 31476 KB Output is correct
9 Correct 28 ms 31716 KB Output is correct
10 Correct 26 ms 31740 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 26 ms 31752 KB Output is correct
15 Correct 26 ms 31636 KB Output is correct
16 Correct 25 ms 31660 KB Output is correct
17 Correct 25 ms 31220 KB Output is correct
18 Correct 26 ms 31684 KB Output is correct
19 Correct 26 ms 31440 KB Output is correct
20 Correct 26 ms 31348 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2004 KB Output is correct
2 Correct 11 ms 14036 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 13 ms 17196 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 27 ms 31660 KB Output is correct
9 Correct 27 ms 31660 KB Output is correct
10 Correct 26 ms 31452 KB Output is correct
11 Correct 25 ms 31656 KB Output is correct
12 Correct 26 ms 31476 KB Output is correct
13 Correct 28 ms 31716 KB Output is correct
14 Correct 26 ms 31740 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 26 ms 31752 KB Output is correct
19 Correct 26 ms 31636 KB Output is correct
20 Correct 25 ms 31660 KB Output is correct
21 Correct 25 ms 31220 KB Output is correct
22 Correct 26 ms 31684 KB Output is correct
23 Correct 26 ms 31440 KB Output is correct
24 Correct 26 ms 31348 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 26 ms 31684 KB Output is correct
29 Correct 26 ms 31748 KB Output is correct
30 Correct 29 ms 33256 KB Output is correct
31 Correct 26 ms 31592 KB Output is correct
32 Correct 25 ms 31684 KB Output is correct
33 Correct 26 ms 31516 KB Output is correct
34 Correct 27 ms 31564 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2004 KB Output is correct
2 Correct 11 ms 14036 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 13 ms 17196 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 27 ms 31660 KB Output is correct
9 Correct 27 ms 31660 KB Output is correct
10 Correct 26 ms 31452 KB Output is correct
11 Correct 25 ms 31656 KB Output is correct
12 Correct 26 ms 31476 KB Output is correct
13 Correct 28 ms 31716 KB Output is correct
14 Correct 26 ms 31740 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 26 ms 31752 KB Output is correct
19 Correct 26 ms 31636 KB Output is correct
20 Correct 25 ms 31660 KB Output is correct
21 Correct 25 ms 31220 KB Output is correct
22 Correct 26 ms 31684 KB Output is correct
23 Correct 26 ms 31440 KB Output is correct
24 Correct 26 ms 31348 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 26 ms 31684 KB Output is correct
29 Correct 26 ms 31748 KB Output is correct
30 Correct 29 ms 33256 KB Output is correct
31 Correct 26 ms 31592 KB Output is correct
32 Correct 25 ms 31684 KB Output is correct
33 Correct 26 ms 31516 KB Output is correct
34 Correct 27 ms 31564 KB Output is correct
35 Correct 26 ms 3536 KB Output is correct
36 Correct 31 ms 4836 KB Output is correct
37 Correct 29 ms 4616 KB Output is correct
38 Correct 56 ms 36348 KB Output is correct
39 Correct 72 ms 37056 KB Output is correct
40 Correct 125 ms 69008 KB Output is correct
41 Correct 71 ms 37300 KB Output is correct
42 Correct 81 ms 38236 KB Output is correct
43 Correct 79 ms 38620 KB Output is correct
44 Correct 88 ms 39604 KB Output is correct
45 Correct 67 ms 40092 KB Output is correct
46 Correct 42 ms 21232 KB Output is correct
47 Correct 73 ms 43388 KB Output is correct
48 Correct 92 ms 52964 KB Output is correct
49 Correct 42 ms 21704 KB Output is correct
50 Correct 51 ms 7088 KB Output is correct