oj.uz

Submission #1007673

# Submission time Handle Problem Language Result Execution time Memory
1007673 2024-06-25T10:03:10 Z Muhammet Knapsack (NOI18_knapsack) C++17
37 / 100
 1000 ms 73756 KB 
#include <bits/stdc++.h>
using namespace std;

#define N 300005
#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second

ll T, n, s, v[N], w[N], k[N], dp[N];

vector <pair<ll,ll>> v1;

int main(){

	cin >> s >> n;
	for(int i = 1; i <= n; i++){
		cin >> v[i] >> w[i] >> k[i];
		for(int j = 1; j <= k[i]; j++){
			v1.push_back({v[i],w[i]});
		}
	}
	for(auto j : v1){
		ll va = j.ff, we = j.ss;
		for(int i = s; i >= 0; i--){
			if(dp[i] != 0 or i == 0){
				dp[i + we] = max(dp[i + we], dp[i] + va);
			}
		}
	}
	ll ans = 0;
	for(int i = 0; i <= s; i++){
		ans = max(dp[i], ans);
	}

	cout << ans;

	return 0;
}

Subtask #1
0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6596 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1018 ms 73756 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 1018 ms 73756 KB Time limit exceeded
2 Halted 0 ms 0 KB -