oj.uz

Submission #465057

# Submission time Handle Problem Language Result Execution time Memory
465057 2021-08-15T03:53:09 Z Qw3rTy Knapsack (NOI18_knapsack) C++11
37 / 100
 2 ms 460 KB 
#include <bits/stdc++.h>
#define pi pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;

const int maxN = 1e5+5;
const int maxV = 2e3+5;

vector<int> d[maxV];
int S,N;
int f[maxV];

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("../test.in","r",stdin);
	cin >> S >> N;
	for(int i = 1; i <= N; ++i){
		int v,w,k; cin >> v >> w >> k;
		for(int j = 1; j <= k; j <<= 1){
			if(w * j > S)break;
			k -= j;
			d[w*j].pb(v*j);
		}
		if(k > 0 && w * k <= S)d[w*k].pb(v*k);
	}
	for(int i = 1; i <= S; ++i){
		if(d[i].size()){ //for each group of objects w/ weight = i
			sort(d[i].begin(),d[i].end(),greater<int>());
			//Consider only the first floor(S/W) objects
			int num = min(S/i,(int)(d[i].size()));
			for(int j = 0; j < num; ++j){
				for(int k = S; k >= i; --k){
					f[k] = max(f[k],f[k-i] + d[i][j]);
				}
			}
		}
	}
	cout << f[S] << '\n';
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Runtime error 1 ms 460 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 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 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 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 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Runtime error 1 ms 460 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Runtime error 1 ms 460 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -