oj.uz

Submission #976761

# Submission time Handle Problem Language Result Execution time Memory
976761 2024-05-07T05:28:53 Z vjudge1 Knapsack (NOI18_knapsack) C++17
100 / 100
 53 ms 19540 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define pll pair<ll,ll>

const ll MOD=1e9+7;

#define ll int
//KALAU TAKUT RTE

bool cmp (pair<ll,ll> x, pair<ll,ll>y){
	return x.second < y.second;
}

ll expo(ll x, ll y){
	if (y==0) return 1;
	ll ans = expo((x*x)%MOD, y/2);
	if (x%2) return (ans * x)%MOD;
	return ans%MOD;
}


signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0); cout.tie(0);
	ll s,n; cin>>s>>n;
	
	vector<pll> vec[s+1];
	ll dp[s+1][s+1];
	for (int i=1; i<=n;i++){
		ll a,b,c; cin>>a>>b>>c;
		vec[b].pb({a,c});
	}
	for (int i=1; i<=s; i++) sort(vec[i].begin(),vec[i].end(), greater<pll>());
	
	memset(dp, 0 ,sizeof(dp));
	for (int i=1 ;i<=s; i++){
		for (int j=1; j<=s; j++){
			dp[i][j]=dp[i-1][j];
			if (vec[i].size()==0) continue;
			ll cnt =0; ll cur=0;
			for (auto x : vec[i]){
				if (cnt > j) break;
				ll tmp = x.second;
				
				for (int k=0; k<x.second; k++){
					cnt += i;
					cur += x.first;
					if (cnt>j) break;
					dp[i][j] = max(dp[i][j], dp[i-1][j-cnt]+cur);
				}
			}
		}
	}
	cout<<dp[s][s]<<endl;
	
}

Compilation message

knapsack.cpp:10: warning: "ll" redefined
   10 | #define ll int
      | 
knapsack.cpp:4: note: this is the location of the previous definition
    4 | #define ll long long
      | 
knapsack.cpp: In function 'int main()':
knapsack.cpp:45:8: warning: unused variable 'tmp' [-Wunused-variable]
   45 |     ll tmp = x.second;
      |        ^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6236 KB Output is correct
2 Correct 5 ms 6456 KB Output is correct
3 Correct 5 ms 6236 KB Output is correct
4 Correct 6 ms 6236 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 12 ms 15964 KB Output is correct
3 Correct 16 ms 16160 KB Output is correct
4 Correct 12 ms 15964 KB Output is correct
5 Correct 12 ms 16108 KB Output is correct
6 Correct 12 ms 15960 KB Output is correct
7 Correct 12 ms 16216 KB Output is correct
8 Correct 12 ms 15964 KB Output is correct
9 Correct 12 ms 15964 KB Output is correct
10 Correct 13 ms 15964 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 12 ms 15964 KB Output is correct
3 Correct 16 ms 16160 KB Output is correct
4 Correct 12 ms 15964 KB Output is correct
5 Correct 12 ms 16108 KB Output is correct
6 Correct 12 ms 15960 KB Output is correct
7 Correct 12 ms 16216 KB Output is correct
8 Correct 12 ms 15964 KB Output is correct
9 Correct 12 ms 15964 KB Output is correct
10 Correct 13 ms 15964 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 14 ms 15964 KB Output is correct
13 Correct 12 ms 15964 KB Output is correct
14 Correct 12 ms 15964 KB Output is correct
15 Correct 11 ms 15928 KB Output is correct
16 Correct 14 ms 15964 KB Output is correct
17 Correct 15 ms 16132 KB Output is correct
18 Correct 14 ms 15964 KB Output is correct
19 Correct 16 ms 15960 KB Output is correct
20 Correct 13 ms 15964 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6236 KB Output is correct
2 Correct 5 ms 6456 KB Output is correct
3 Correct 5 ms 6236 KB Output is correct
4 Correct 6 ms 6236 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 12 ms 15964 KB Output is correct
7 Correct 16 ms 16160 KB Output is correct
8 Correct 12 ms 15964 KB Output is correct
9 Correct 12 ms 16108 KB Output is correct
10 Correct 12 ms 15960 KB Output is correct
11 Correct 12 ms 16216 KB Output is correct
12 Correct 12 ms 15964 KB Output is correct
13 Correct 12 ms 15964 KB Output is correct
14 Correct 13 ms 15964 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 14 ms 15964 KB Output is correct
17 Correct 12 ms 15964 KB Output is correct
18 Correct 12 ms 15964 KB Output is correct
19 Correct 11 ms 15928 KB Output is correct
20 Correct 14 ms 15964 KB Output is correct
21 Correct 15 ms 16132 KB Output is correct
22 Correct 14 ms 15964 KB Output is correct
23 Correct 16 ms 15960 KB Output is correct
24 Correct 13 ms 15964 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 14 ms 16124 KB Output is correct
27 Correct 14 ms 15960 KB Output is correct
28 Correct 12 ms 15964 KB Output is correct
29 Correct 12 ms 15960 KB Output is correct
30 Correct 16 ms 15964 KB Output is correct
31 Correct 15 ms 15964 KB Output is correct
32 Correct 12 ms 16216 KB Output is correct
33 Correct 14 ms 15964 KB Output is correct
34 Correct 13 ms 16136 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 6236 KB Output is correct
2 Correct 5 ms 6456 KB Output is correct
3 Correct 5 ms 6236 KB Output is correct
4 Correct 6 ms 6236 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 12 ms 15964 KB Output is correct
7 Correct 16 ms 16160 KB Output is correct
8 Correct 12 ms 15964 KB Output is correct
9 Correct 12 ms 16108 KB Output is correct
10 Correct 12 ms 15960 KB Output is correct
11 Correct 12 ms 16216 KB Output is correct
12 Correct 12 ms 15964 KB Output is correct
13 Correct 12 ms 15964 KB Output is correct
14 Correct 13 ms 15964 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 14 ms 15964 KB Output is correct
17 Correct 12 ms 15964 KB Output is correct
18 Correct 12 ms 15964 KB Output is correct
19 Correct 11 ms 15928 KB Output is correct
20 Correct 14 ms 15964 KB Output is correct
21 Correct 15 ms 16132 KB Output is correct
22 Correct 14 ms 15964 KB Output is correct
23 Correct 16 ms 15960 KB Output is correct
24 Correct 13 ms 15964 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 14 ms 16124 KB Output is correct
27 Correct 14 ms 15960 KB Output is correct
28 Correct 12 ms 15964 KB Output is correct
29 Correct 12 ms 15960 KB Output is correct
30 Correct 16 ms 15964 KB Output is correct
31 Correct 15 ms 15964 KB Output is correct
32 Correct 12 ms 16216 KB Output is correct
33 Correct 14 ms 15964 KB Output is correct
34 Correct 13 ms 16136 KB Output is correct
35 Correct 22 ms 2264 KB Output is correct
36 Correct 37 ms 18140 KB Output is correct
37 Correct 38 ms 18128 KB Output is correct
38 Correct 34 ms 18448 KB Output is correct
39 Correct 41 ms 19152 KB Output is correct
40 Correct 53 ms 19280 KB Output is correct
41 Correct 49 ms 18516 KB Output is correct
42 Correct 48 ms 18624 KB Output is correct
43 Correct 51 ms 18512 KB Output is correct
44 Correct 50 ms 18592 KB Output is correct
45 Correct 43 ms 19280 KB Output is correct
46 Correct 39 ms 18896 KB Output is correct
47 Correct 44 ms 19540 KB Output is correct
48 Correct 50 ms 19292 KB Output is correct
49 Correct 39 ms 19024 KB Output is correct
50 Correct 45 ms 19032 KB Output is correct