oj.uz

Submission #497109

# Submission time Handle Problem Language Result Execution time Memory
497109 2021-12-22T12:34:46 Z Blistering_Barnacles Knapsack (NOI18_knapsack) C++11
100 / 100
 104 ms 49304 KB 
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vpll vector< pll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[2005][2005] , a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vpll W[555555];
const ll mod = 1e9+7;
ll s;
void solve(){
    cin >> s >> n ;
    ll mx = 0 ;
    for(ll i = 1 ; i <= n ; i++){
        cin >> p >> o >> k ;
        W[o].pb({p , k}) ;
        mx = max(mx , o) ;
    }
    dp[0][0] = 0 ;
    ll ans = 0 ;
    for(ll i = 1 ; i <= mx ; i++){
        sort(all(W[i])) ;
        reverse(all(W[i])) ;
        for(ll S = 0 ; S <= s ; S++){
            dp[i][S] = dp[i - 1][S] ;
            ll j = 0 , cnt = 1 , p = 0 , k = 0 ;
            while(i * cnt <= S && j < sz(W[i])){
                p += W[i][j].F ;
                dp[i][S] = max(dp[i][S] , dp[i - 1][S - cnt * i] + p) ;
                cnt++ , k++ ;
                ans = max(ans , dp[i][S]) ;
                if(k == W[i][j].S){
                    k = 0 ;
                    j++ ;
                }
            }
        }
    }
    cout << ans << endl ;
}
int main(){
    fast ;
    q = 1 ;
    //cin >> q ;
    while(q--){
        solve() ;
    }
}

Compilation message

knapsack.cpp: In function 'void solve()':
knapsack.cpp:53:37: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |             while(i * cnt <= S && j < sz(W[i])){
      |                                     ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15028 KB Output is correct
2 Correct 13 ms 26932 KB Output is correct
3 Correct 7 ms 13364 KB Output is correct
4 Correct 17 ms 30156 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 13364 KB Output is correct
2 Correct 8 ms 13364 KB Output is correct
3 Correct 8 ms 13372 KB Output is correct
4 Correct 30 ms 44612 KB Output is correct
5 Correct 25 ms 44692 KB Output is correct
6 Correct 24 ms 44496 KB Output is correct
7 Correct 25 ms 44588 KB Output is correct
8 Correct 24 ms 44532 KB Output is correct
9 Correct 23 ms 44604 KB Output is correct
10 Correct 25 ms 44644 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 13364 KB Output is correct
2 Correct 8 ms 13364 KB Output is correct
3 Correct 8 ms 13372 KB Output is correct
4 Correct 30 ms 44612 KB Output is correct
5 Correct 25 ms 44692 KB Output is correct
6 Correct 24 ms 44496 KB Output is correct
7 Correct 25 ms 44588 KB Output is correct
8 Correct 24 ms 44532 KB Output is correct
9 Correct 23 ms 44604 KB Output is correct
10 Correct 25 ms 44644 KB Output is correct
11 Correct 7 ms 13368 KB Output is correct
12 Correct 13 ms 13328 KB Output is correct
13 Correct 8 ms 13364 KB Output is correct
14 Correct 23 ms 44748 KB Output is correct
15 Correct 29 ms 44700 KB Output is correct
16 Correct 31 ms 44620 KB Output is correct
17 Correct 30 ms 44208 KB Output is correct
18 Correct 25 ms 44620 KB Output is correct
19 Correct 25 ms 44460 KB Output is correct
20 Correct 27 ms 44344 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15028 KB Output is correct
2 Correct 13 ms 26932 KB Output is correct
3 Correct 7 ms 13364 KB Output is correct
4 Correct 17 ms 30156 KB Output is correct
5 Correct 7 ms 13364 KB Output is correct
6 Correct 8 ms 13364 KB Output is correct
7 Correct 8 ms 13372 KB Output is correct
8 Correct 30 ms 44612 KB Output is correct
9 Correct 25 ms 44692 KB Output is correct
10 Correct 24 ms 44496 KB Output is correct
11 Correct 25 ms 44588 KB Output is correct
12 Correct 24 ms 44532 KB Output is correct
13 Correct 23 ms 44604 KB Output is correct
14 Correct 25 ms 44644 KB Output is correct
15 Correct 7 ms 13368 KB Output is correct
16 Correct 13 ms 13328 KB Output is correct
17 Correct 8 ms 13364 KB Output is correct
18 Correct 23 ms 44748 KB Output is correct
19 Correct 29 ms 44700 KB Output is correct
20 Correct 31 ms 44620 KB Output is correct
21 Correct 30 ms 44208 KB Output is correct
22 Correct 25 ms 44620 KB Output is correct
23 Correct 25 ms 44460 KB Output is correct
24 Correct 27 ms 44344 KB Output is correct
25 Correct 10 ms 13260 KB Output is correct
26 Correct 15 ms 13400 KB Output is correct
27 Correct 9 ms 13388 KB Output is correct
28 Correct 25 ms 44664 KB Output is correct
29 Correct 24 ms 44724 KB Output is correct
30 Correct 29 ms 44600 KB Output is correct
31 Correct 27 ms 44476 KB Output is correct
32 Correct 25 ms 44620 KB Output is correct
33 Correct 25 ms 44496 KB Output is correct
34 Correct 26 ms 44624 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15028 KB Output is correct
2 Correct 13 ms 26932 KB Output is correct
3 Correct 7 ms 13364 KB Output is correct
4 Correct 17 ms 30156 KB Output is correct
5 Correct 7 ms 13364 KB Output is correct
6 Correct 8 ms 13364 KB Output is correct
7 Correct 8 ms 13372 KB Output is correct
8 Correct 30 ms 44612 KB Output is correct
9 Correct 25 ms 44692 KB Output is correct
10 Correct 24 ms 44496 KB Output is correct
11 Correct 25 ms 44588 KB Output is correct
12 Correct 24 ms 44532 KB Output is correct
13 Correct 23 ms 44604 KB Output is correct
14 Correct 25 ms 44644 KB Output is correct
15 Correct 7 ms 13368 KB Output is correct
16 Correct 13 ms 13328 KB Output is correct
17 Correct 8 ms 13364 KB Output is correct
18 Correct 23 ms 44748 KB Output is correct
19 Correct 29 ms 44700 KB Output is correct
20 Correct 31 ms 44620 KB Output is correct
21 Correct 30 ms 44208 KB Output is correct
22 Correct 25 ms 44620 KB Output is correct
23 Correct 25 ms 44460 KB Output is correct
24 Correct 27 ms 44344 KB Output is correct
25 Correct 10 ms 13260 KB Output is correct
26 Correct 15 ms 13400 KB Output is correct
27 Correct 9 ms 13388 KB Output is correct
28 Correct 25 ms 44664 KB Output is correct
29 Correct 24 ms 44724 KB Output is correct
30 Correct 29 ms 44600 KB Output is correct
31 Correct 27 ms 44476 KB Output is correct
32 Correct 25 ms 44620 KB Output is correct
33 Correct 25 ms 44496 KB Output is correct
34 Correct 26 ms 44624 KB Output is correct
35 Correct 40 ms 16328 KB Output is correct
36 Correct 43 ms 16524 KB Output is correct
37 Correct 42 ms 16392 KB Output is correct
38 Correct 54 ms 47992 KB Output is correct
39 Correct 77 ms 48568 KB Output is correct
40 Correct 104 ms 49104 KB Output is correct
41 Correct 71 ms 48452 KB Output is correct
42 Correct 72 ms 48360 KB Output is correct
43 Correct 96 ms 48348 KB Output is correct
44 Correct 92 ms 48228 KB Output is correct
45 Correct 63 ms 49056 KB Output is correct
46 Correct 49 ms 32688 KB Output is correct
47 Correct 63 ms 49304 KB Output is correct
48 Correct 77 ms 49068 KB Output is correct
49 Correct 46 ms 33292 KB Output is correct
50 Correct 73 ms 17904 KB Output is correct