oj.uz

Submission #405248

# Submission time Handle Problem Language Result Execution time Memory
405248 2021-05-16T04:18:58 Z balbit Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 19 ms 1352 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define pii pair<int, int>
#define f first
#define s second

#define ALL(x) (x).begin(),(x).end()
#define SZ(x) (int)((x).size())
#define pb push_back

#define REP(i,n) for (int i = 0; i<n; ++i)

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x){ cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S && ...y){ cerr<<x<<", "; _do(y...);}
#else
#define bug(...)
#define endl '\n'
#endif // BALBIT



const int maxn = 3e5+5;

ll cnt[62][62]; // number of constraints from these ones
ll lm[62]; // what's my constraint?

ll c2(ll x, vector<ll> a) {
    while(SZ(a) < 61) a.pb(0);
    int K = 61;
    ll sm = 0;
    memset(cnt, 0, sizeof cnt);
    memset(lm, 0, sizeof lm);
    for (int i = 0; i<K; ++i) {
        sm += (1ll<<i) * a[i];
        ll ho = sm / x;
        lm[i] = ho;
    }
    cnt[K-1][K-1] = 1;
    ll re = 0;
    for (int i = 0; i<=200000; ++i) { bool ok = 1;
        for (int j = 0; j<K; ++j) {
            if ((i & ((1ll<<(j+1))-1)) > lm[j]) {
                ok = 0; break;
            }
        }
        re += ok;
    }
    return re;
}

long long count_tastiness(long long x, std::vector<long long> a) {
    while(SZ(a) < 61) a.pb(0);
    int K = 61;
    ll sm = 0;
    memset(cnt, 0, sizeof cnt);
    memset(lm, 0, sizeof lm);
    for (int i = 0; i<K; ++i) {
        sm += (1ll<<i) * a[i];
        ll ho = sm / x;
        lm[i] = min((1ll<<(i+1))-1, ho);
    }
    cnt[K-1][K-1] = 1;
    ll re = 0;


    for (int i = K-1; i>=0; --i) {
        ll msk = (1ll<<(i+1)) - 1;
        for (int frm = K-1; frm >= i; --frm) {
            if (cnt[i][frm]) {
//                bug(i, frm, cnt[i][frm]);
                ll dis = lm[frm] & msk;
                if (dis > lm[i]) {
                    cnt[i][i] += cnt[i][frm];
                }else{
                    if (dis == 0) re += cnt[i][frm];
                    else{
                        if (dis >= (1ll<<i)) {
                            // can choose to not take
                            (i?cnt[i-1][i-1]:re) += cnt[i][frm];
                        }
                        {
                            // need to be restrained
                            (i?cnt[i-1][frm]:re) += cnt[i][frm];
                        }
                    }
                }
            }
        }
    }
    return re;

}

#ifdef BALBIT
signed main(){
    REP(ccc, 1000) {
        ll x = 1;
        vector<int> a;
        REP(i,3) a.pb(rand()%3);
        ll A = count_tastiness(x,a);
        ll B = c2(x,a);
        if (A!=B) {
            bug(A,B);
            bug(x);
            for (int y : a) cout<<y<<' ';
            cout<<endl;
            assert(0);

        }
    }
}
#endif // BALBIT

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 332 KB Output is correct
2 Correct 14 ms 1164 KB Output is correct
3 Correct 15 ms 1228 KB Output is correct
4 Correct 15 ms 1212 KB Output is correct
5 Correct 14 ms 1228 KB Output is correct
6 Correct 14 ms 1100 KB Output is correct
7 Correct 17 ms 1152 KB Output is correct
8 Correct 14 ms 1072 KB Output is correct
9 Correct 15 ms 1112 KB Output is correct
10 Correct 13 ms 1160 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 296 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 6 ms 332 KB Output is correct
38 Correct 14 ms 1164 KB Output is correct
39 Correct 15 ms 1228 KB Output is correct
40 Correct 15 ms 1212 KB Output is correct
41 Correct 14 ms 1228 KB Output is correct
42 Correct 14 ms 1100 KB Output is correct
43 Correct 17 ms 1152 KB Output is correct
44 Correct 14 ms 1072 KB Output is correct
45 Correct 15 ms 1112 KB Output is correct
46 Correct 13 ms 1160 KB Output is correct
47 Correct 7 ms 424 KB Output is correct
48 Correct 19 ms 1352 KB Output is correct
49 Correct 9 ms 332 KB Output is correct
50 Correct 17 ms 1100 KB Output is correct
51 Correct 14 ms 1256 KB Output is correct
52 Correct 6 ms 332 KB Output is correct
53 Correct 15 ms 1228 KB Output is correct
54 Correct 18 ms 1156 KB Output is correct
55 Correct 18 ms 1152 KB Output is correct
56 Correct 17 ms 1232 KB Output is correct
57 Correct 16 ms 1168 KB Output is correct