oj.uz

Submission #464288

# Submission time Handle Problem Language Result Execution time Memory
464288 2021-08-12T17:54:44 Z vbee Knapsack (NOI18_knapsack) C++17
73 / 100
 183 ms 262148 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define fi first
#define se second
#define TASK ""
#define ll long long
#define pll pair<ll, ll>
#define vll vector<ll>
#define vpll vector<pll>
#define pb push_back
#define MASK(i) (1 << (i))
#define BIT(x, i) ((x >> (i)) & 1)

using namespace std;

const int oo = 1e9 + 7;
const ll loo = (ll)1e18 + 7;
const int N = 1e5 + 7;
const int S = 2007;
int dp[N][S], w[N], v[N], k[N], n, s;
void maximize(int &a, int b){
	if (a < b) a = b;
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> s >> n;
	for (int i = 1; i <= n; i++) cin >> v[i] >> w[i] >> k[i];
	for (int i = 0; i < n; i++){
		for (int sum = 0; sum <= s; sum++){
			for (int z = 0; z <= k[i + 1]; z++){
				if (sum + w[i + 1] * z > s) break;
				maximize(dp[i + 1][sum + w[i + 1] * z], dp[i][sum] + v[i + 1] * z);
			}
		}
	}
	int res = 0;
	for (int i = 0; i <= s; i++) maximize(res, dp[n][i]);
	cout << res;
	return 0;
}

Subtask #1
12.0 / 12.0

# 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 1 ms 332 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 2 ms 1084 KB Output is correct
3 Correct 2 ms 972 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 2 ms 1100 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 2 ms 1084 KB Output is correct
3 Correct 2 ms 972 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 2 ms 972 KB Output is correct
10 Correct 2 ms 1100 KB Output is correct
11 Correct 1 ms 716 KB Output is correct
12 Correct 4 ms 1100 KB Output is correct
13 Correct 2 ms 972 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 2 ms 1100 KB Output is correct
17 Correct 2 ms 972 KB Output is correct
18 Correct 2 ms 972 KB Output is correct
19 Correct 2 ms 972 KB Output is correct
20 Correct 2 ms 1100 KB Output is correct

Subtask #4
24.0 / 24.0

# 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 1 ms 332 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 2 ms 1084 KB Output is correct
7 Correct 2 ms 972 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 1 ms 716 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 2 ms 972 KB Output is correct
13 Correct 2 ms 972 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 4 ms 1100 KB Output is correct
17 Correct 2 ms 972 KB Output is correct
18 Correct 1 ms 716 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 2 ms 1100 KB Output is correct
21 Correct 2 ms 972 KB Output is correct
22 Correct 2 ms 972 KB Output is correct
23 Correct 2 ms 972 KB Output is correct
24 Correct 2 ms 1100 KB Output is correct
25 Correct 1 ms 716 KB Output is correct
26 Correct 152 ms 1092 KB Output is correct
27 Correct 2 ms 972 KB Output is correct
28 Correct 1 ms 716 KB Output is correct
29 Correct 1 ms 716 KB Output is correct
30 Correct 2 ms 1100 KB Output is correct
31 Correct 2 ms 1100 KB Output is correct
32 Correct 2 ms 1100 KB Output is correct
33 Correct 2 ms 972 KB Output is correct
34 Correct 2 ms 972 KB Output is correct

Subtask #5
0 / 27.0

# 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 1 ms 332 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 2 ms 1084 KB Output is correct
7 Correct 2 ms 972 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 1 ms 716 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1100 KB Output is correct
12 Correct 2 ms 972 KB Output is correct
13 Correct 2 ms 972 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 4 ms 1100 KB Output is correct
17 Correct 2 ms 972 KB Output is correct
18 Correct 1 ms 716 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 2 ms 1100 KB Output is correct
21 Correct 2 ms 972 KB Output is correct
22 Correct 2 ms 972 KB Output is correct
23 Correct 2 ms 972 KB Output is correct
24 Correct 2 ms 1100 KB Output is correct
25 Correct 1 ms 716 KB Output is correct
26 Correct 152 ms 1092 KB Output is correct
27 Correct 2 ms 972 KB Output is correct
28 Correct 1 ms 716 KB Output is correct
29 Correct 1 ms 716 KB Output is correct
30 Correct 2 ms 1100 KB Output is correct
31 Correct 2 ms 1100 KB Output is correct
32 Correct 2 ms 1100 KB Output is correct
33 Correct 2 ms 972 KB Output is correct
34 Correct 2 ms 972 KB Output is correct
35 Runtime error 183 ms 262148 KB Execution killed with signal 9
36 Halted 0 ms 0 KB -