oj.uz

Submission #411911

# Submission time Handle Problem Language Result Execution time Memory
411911 2021-05-26T08:42:04 Z kwongweng Knapsack (NOI18_knapsack) C++17
100 / 100
 96 ms 19392 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define ms memset
#define pb push_back
#define F first
#define S second
ll MOD = 1000000007;
 
ll power(ll base, ll n){
	if (n == 0) return 1;
	if (n == 1) return base;
	ll halfn = power(base, n/2);
	if (n % 2 == 0) return (halfn * halfn) % MOD;
	return (((halfn * halfn) % MOD) * base) % MOD;
}
 
ll inverse(ll n){
	return power(n, MOD-2);
}
 
ll add(ll a, ll b){
	return (a+b) % MOD;
}

ll mul(ll a, ll b){
	return (a*b) % MOD;
}

ll gcd(ll a, ll b){
	if (a == 0) return b;
	if (a == 1) return 1;
	return gcd(b % a, a);
}

int main(){
    ios::sync_with_stdio(false);
    int s, n; cin >> s >> n;
    vi cnt(s+1);
    vector<pair<int, ii> > knap;
    FOR(i, 0, n){
    	int v, w, k; cin >> v >> w >> k;
    	if (w > s) continue;
    	knap.pb({v, {w, k}});
	}
	sort(knap.rbegin(), knap.rend());
	n = knap.size();
	vi V[s+1];
	FOR(i,1,s+1) V[i].pb(0);
	FOR(i, 0, n){
		int v = knap[i].F, w = knap[i].S.F, k = knap[i].S.S;
		int len = V[w].size();
		if (len >= s/w+1) continue;
		FOR(j, len, min(len+k, s/w+1)){
			V[w].pb(V[w][j-1] + v);
		}
	}
	int dp[s+1][s+1];
	ms(dp, 0, sizeof(dp));
	FOR(i, 1, s+1){
		FOR(j, 0, s+1){
			FOR(k, 0, min(j/i+1, (int)V[i].size())){
				dp[i][j] = max(dp[i][j], dp[i-1][j-k*i] + V[i][k]);
			}
		}
	}
	cout << dp[s][s] << '\n';
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 6348 KB Output is correct
2 Correct 13 ms 6348 KB Output is correct
3 Correct 13 ms 6332 KB Output is correct
4 Correct 12 ms 6344 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 32 ms 16076 KB Output is correct
3 Correct 32 ms 16076 KB Output is correct
4 Correct 33 ms 16012 KB Output is correct
5 Correct 32 ms 16012 KB Output is correct
6 Correct 36 ms 16076 KB Output is correct
7 Correct 32 ms 16080 KB Output is correct
8 Correct 36 ms 15924 KB Output is correct
9 Correct 33 ms 15964 KB Output is correct
10 Correct 32 ms 16056 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 32 ms 16076 KB Output is correct
3 Correct 32 ms 16076 KB Output is correct
4 Correct 33 ms 16012 KB Output is correct
5 Correct 32 ms 16012 KB Output is correct
6 Correct 36 ms 16076 KB Output is correct
7 Correct 32 ms 16080 KB Output is correct
8 Correct 36 ms 15924 KB Output is correct
9 Correct 33 ms 15964 KB Output is correct
10 Correct 32 ms 16056 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 33 ms 16092 KB Output is correct
13 Correct 31 ms 15948 KB Output is correct
14 Correct 31 ms 16056 KB Output is correct
15 Correct 31 ms 15928 KB Output is correct
16 Correct 31 ms 16056 KB Output is correct
17 Correct 34 ms 15948 KB Output is correct
18 Correct 31 ms 16056 KB Output is correct
19 Correct 33 ms 16052 KB Output is correct
20 Correct 31 ms 16076 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 6348 KB Output is correct
2 Correct 13 ms 6348 KB Output is correct
3 Correct 13 ms 6332 KB Output is correct
4 Correct 12 ms 6344 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 32 ms 16076 KB Output is correct
7 Correct 32 ms 16076 KB Output is correct
8 Correct 33 ms 16012 KB Output is correct
9 Correct 32 ms 16012 KB Output is correct
10 Correct 36 ms 16076 KB Output is correct
11 Correct 32 ms 16080 KB Output is correct
12 Correct 36 ms 15924 KB Output is correct
13 Correct 33 ms 15964 KB Output is correct
14 Correct 32 ms 16056 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 33 ms 16092 KB Output is correct
17 Correct 31 ms 15948 KB Output is correct
18 Correct 31 ms 16056 KB Output is correct
19 Correct 31 ms 15928 KB Output is correct
20 Correct 31 ms 16056 KB Output is correct
21 Correct 34 ms 15948 KB Output is correct
22 Correct 31 ms 16056 KB Output is correct
23 Correct 33 ms 16052 KB Output is correct
24 Correct 31 ms 16076 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 34 ms 15972 KB Output is correct
27 Correct 32 ms 16204 KB Output is correct
28 Correct 33 ms 15948 KB Output is correct
29 Correct 32 ms 16052 KB Output is correct
30 Correct 32 ms 16076 KB Output is correct
31 Correct 32 ms 15960 KB Output is correct
32 Correct 31 ms 16060 KB Output is correct
33 Correct 34 ms 15948 KB Output is correct
34 Correct 35 ms 16012 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 6348 KB Output is correct
2 Correct 13 ms 6348 KB Output is correct
3 Correct 13 ms 6332 KB Output is correct
4 Correct 12 ms 6344 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 32 ms 16076 KB Output is correct
7 Correct 32 ms 16076 KB Output is correct
8 Correct 33 ms 16012 KB Output is correct
9 Correct 32 ms 16012 KB Output is correct
10 Correct 36 ms 16076 KB Output is correct
11 Correct 32 ms 16080 KB Output is correct
12 Correct 36 ms 15924 KB Output is correct
13 Correct 33 ms 15964 KB Output is correct
14 Correct 32 ms 16056 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 33 ms 16092 KB Output is correct
17 Correct 31 ms 15948 KB Output is correct
18 Correct 31 ms 16056 KB Output is correct
19 Correct 31 ms 15928 KB Output is correct
20 Correct 31 ms 16056 KB Output is correct
21 Correct 34 ms 15948 KB Output is correct
22 Correct 31 ms 16056 KB Output is correct
23 Correct 33 ms 16052 KB Output is correct
24 Correct 31 ms 16076 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 34 ms 15972 KB Output is correct
27 Correct 32 ms 16204 KB Output is correct
28 Correct 33 ms 15948 KB Output is correct
29 Correct 32 ms 16052 KB Output is correct
30 Correct 32 ms 16076 KB Output is correct
31 Correct 32 ms 15960 KB Output is correct
32 Correct 31 ms 16060 KB Output is correct
33 Correct 34 ms 15948 KB Output is correct
34 Correct 35 ms 16012 KB Output is correct
35 Correct 39 ms 2760 KB Output is correct
36 Correct 77 ms 18564 KB Output is correct
37 Correct 74 ms 18292 KB Output is correct
38 Correct 74 ms 18592 KB Output is correct
39 Correct 78 ms 19392 KB Output is correct
40 Correct 92 ms 19380 KB Output is correct
41 Correct 96 ms 18536 KB Output is correct
42 Correct 86 ms 18608 KB Output is correct
43 Correct 87 ms 18552 KB Output is correct
44 Correct 87 ms 18544 KB Output is correct
45 Correct 80 ms 19300 KB Output is correct
46 Correct 76 ms 19172 KB Output is correct
47 Correct 94 ms 19316 KB Output is correct
48 Correct 84 ms 19312 KB Output is correct
49 Correct 76 ms 19124 KB Output is correct
50 Correct 88 ms 19264 KB Output is correct