oj.uz

Submission #699288

# Submission time Handle Problem Language Result Execution time Memory
699288 2023-02-16T12:52:24 Z urosk Packing Biscuits (IOI20_biscuits) C++14
42 / 100
 1000 ms 3532 KB 
#include "biscuits.h"
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}

#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
ll n = 60;
ll dp[61],b[61];
ll count_tastiness(ll x, vector<ll> a) {
    while(sz(a)<n) a.pb(0);
    for(ll i = 0;i<=n;i++) b[i] = a[i];
    for(ll i = 1;i<=n;i++) b[i]+=b[i-1]/2;
    dp[0] = 1;
    for(ll i = 0;i<n;i++){
        dp[i+1] = dp[i];
        if(b[i]<x) continue;
        ll k = (x-a[i])*2;
        for(ll j = i-1;j>=0;j--){
            k = max(k,0LL);
            dbg(k);
            if(b[j]>=k+x) dp[i+1]+=dp[j],k = (k+x-a[j])*2;
            else k = (k-a[j])*2;
        }
        k = max(k,0LL);
        if(k==0) dp[i+1]++;
    }
	return dp[n];
}
/*
2
3 2
2 1 2
3 3
5 2 1
*/

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 5 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 8 ms 212 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 6 ms 212 KB Output is correct
9 Correct 4 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 5 ms 296 KB Output is correct
13 Correct 5 ms 212 KB Output is correct
14 Correct 3 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 26 ms 336 KB Output is correct
3 Correct 85 ms 464 KB Output is correct
4 Correct 58 ms 292 KB Output is correct
5 Correct 67 ms 432 KB Output is correct
6 Correct 78 ms 316 KB Output is correct
7 Correct 51 ms 340 KB Output is correct
8 Correct 77 ms 332 KB Output is correct
9 Correct 68 ms 316 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 332 KB Output is correct
2 Correct 23 ms 336 KB Output is correct
3 Correct 44 ms 328 KB Output is correct
4 Correct 63 ms 340 KB Output is correct
5 Correct 59 ms 320 KB Output is correct
6 Correct 73 ms 324 KB Output is correct
7 Correct 50 ms 332 KB Output is correct
8 Correct 51 ms 332 KB Output is correct
9 Correct 35 ms 340 KB Output is correct
10 Correct 70 ms 480 KB Output is correct
11 Correct 63 ms 368 KB Output is correct
12 Correct 55 ms 340 KB Output is correct
13 Correct 51 ms 356 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 607 ms 2004 KB Output is correct
2 Execution timed out 1090 ms 3532 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 5 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 8 ms 212 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 6 ms 212 KB Output is correct
9 Correct 4 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 5 ms 296 KB Output is correct
13 Correct 5 ms 212 KB Output is correct
14 Correct 3 ms 212 KB Output is correct
15 Correct 3 ms 212 KB Output is correct
16 Correct 26 ms 336 KB Output is correct
17 Correct 85 ms 464 KB Output is correct
18 Correct 58 ms 292 KB Output is correct
19 Correct 67 ms 432 KB Output is correct
20 Correct 78 ms 316 KB Output is correct
21 Correct 51 ms 340 KB Output is correct
22 Correct 77 ms 332 KB Output is correct
23 Correct 68 ms 316 KB Output is correct
24 Correct 16 ms 332 KB Output is correct
25 Correct 23 ms 336 KB Output is correct
26 Correct 44 ms 328 KB Output is correct
27 Correct 63 ms 340 KB Output is correct
28 Correct 59 ms 320 KB Output is correct
29 Correct 73 ms 324 KB Output is correct
30 Correct 50 ms 332 KB Output is correct
31 Correct 51 ms 332 KB Output is correct
32 Correct 35 ms 340 KB Output is correct
33 Correct 70 ms 480 KB Output is correct
34 Correct 63 ms 368 KB Output is correct
35 Correct 55 ms 340 KB Output is correct
36 Correct 51 ms 356 KB Output is correct
37 Correct 607 ms 2004 KB Output is correct
38 Execution timed out 1090 ms 3532 KB Time limit exceeded
39 Halted 0 ms 0 KB -