oj.uz

Submission #934115

# Submission time Handle Problem Language Result Execution time Memory
934115 2024-02-26T19:36:01 Z KindaGoodGames Knapsack (NOI18_knapsack) C++14
37 / 100
 1000 ms 476 KB 
#include <bits/stdc++.h>
using namespace std;
int const INF = numeric_limits<int>::max() / 2;
#define ll long long 
string out = "";
bool hasCycles = false;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tiii tuple<int,int,int>
#define tiid tuple<double,int,int>
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	int s, n;
	cin >> s >> n;

	vector<int> weight, value, amt;
	weight = value = amt = vector<int>(n);
	for (int i = 0; i < n; i++) {
		cin >> value[i] >> weight[i] >> amt[i];
	}

	vector<ll> dp(s + 1);
	for (int j = 0; j < n; j++) {
		for (int i = s; i >= 0; i--) {

			for (int k = 0; k < amt[j]; k++) {
				if (weight[j] * (k + 1) > i) continue;
				dp[i] = max(dp[i], dp[i - ((k + 1) * weight[j])] + value[j] * (k + 1));
			}
		}
	}


	ll ma = 0;
	for (auto d : dp) {
		ma = max(ma, d);
	}

	cout << ma;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1058 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 476 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 476 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 472 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1058 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1058 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -