Submission #699289

# Submission time Handle Problem Language Result Execution time Memory
699289 2023-02-16T12:53:07 Z urosk Packing Biscuits (IOI20_biscuits) C++14
100 / 100
14 ms 1320 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);
            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
*/
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 8 ms 724 KB Output is correct
3 Correct 9 ms 1100 KB Output is correct
4 Correct 9 ms 1108 KB Output is correct
5 Correct 8 ms 1112 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 7 ms 1152 KB Output is correct
8 Correct 8 ms 1080 KB Output is correct
9 Correct 10 ms 1108 KB Output is correct
10 Correct 8 ms 1108 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 3 ms 340 KB Output is correct
38 Correct 8 ms 724 KB Output is correct
39 Correct 9 ms 1100 KB Output is correct
40 Correct 9 ms 1108 KB Output is correct
41 Correct 8 ms 1112 KB Output is correct
42 Correct 8 ms 1108 KB Output is correct
43 Correct 7 ms 1152 KB Output is correct
44 Correct 8 ms 1080 KB Output is correct
45 Correct 10 ms 1108 KB Output is correct
46 Correct 8 ms 1108 KB Output is correct
47 Correct 3 ms 340 KB Output is correct
48 Correct 14 ms 1320 KB Output is correct
49 Correct 5 ms 340 KB Output is correct
50 Correct 11 ms 1084 KB Output is correct
51 Correct 11 ms 1240 KB Output is correct
52 Correct 2 ms 340 KB Output is correct
53 Correct 7 ms 1108 KB Output is correct
54 Correct 10 ms 1108 KB Output is correct
55 Correct 10 ms 1080 KB Output is correct
56 Correct 11 ms 1204 KB Output is correct
57 Correct 12 ms 1204 KB Output is correct