oj.uz

Submission #397594

# Submission time Handle Problem Language Result Execution time Memory
397594 2021-05-02T13:02:41 Z qwerasdfzxcl Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 187 ms 1356 KB 
#include "biscuits.h"
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
vector<ll> A;
ll X;

map<ll, ll> calc(set<ll> &st, int k){
    if (!k){
        map<ll, ll> ret;
        ret[0] = 1;
        ret[1] = ret[0] + (A[0]>=X);
        return ret;
    }
    ll S = 0;
    for (int i=0;i<=k;i++) S += (1LL<<i)*A[i];
    ll c = S/X, mx1 = (1LL<<k)-1;
    set<ll> tmp;
    if (c<(1LL<<(k+1))) tmp.insert(c&((1LL<<k)-1));
    for (auto &val:st) tmp.insert(val&mx1);
    map<ll, ll> tmp2 = calc(tmp, k-1), ret;
    if (c<(1LL<<(k+1)) && c>mx1) ret[c] = tmp2[mx1]+tmp2[c&mx1];
    else if (c<=mx1) ret[c] = tmp2[c];
    for (auto &val:st){
        if (val<=mx1) ret[val] = tmp2[val];
        else if (val<=c){
            ret[val] = tmp2[mx1]+tmp2[val&mx1];
        }
        else ret[val] = ret[c];
    }
    return ret;
}

long long count_tastiness(long long x, vector<long long> a) {
    A = a;
    X = x;
    ll S = 0;
    int k = (int)A.size()-1;
    for (;!A[k];k--);
    for (int i=0;i<=k;i++) S += (1LL<<i)*A[i];
    //printf(" %d ", k);
    if (!k) return S/x+1;
    if (k<0) return 1;
    ll mx = (1LL<<k)-1, q = (A[k]-1)/x+1;
    ll sr = (S/x)&mx;
    set<ll> tmp;
    tmp.insert(mx);
    tmp.insert(sr);
    map<ll, ll> M = calc(tmp, k-1);
    //printf("%lld %lld\n", M[mx], M[sr]);
    ll ans = M[mx]*q;
    ans += ((S/x)/(1LL<<k)+1-q)*M[mx];
    ans -= M[mx] - M[sr];
    return ans;
}

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 208 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 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 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 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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 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 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 300 KB Output is correct
13 Correct 2 ms 332 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 119 ms 844 KB Output is correct
3 Correct 119 ms 1216 KB Output is correct
4 Correct 118 ms 1208 KB Output is correct
5 Correct 119 ms 1220 KB Output is correct
6 Correct 187 ms 1152 KB Output is correct
7 Correct 171 ms 1100 KB Output is correct
8 Correct 157 ms 1168 KB Output is correct
9 Correct 151 ms 1084 KB Output is correct
10 Correct 122 ms 1100 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 208 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 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 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 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 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 204 KB Output is correct
29 Correct 1 ms 204 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 204 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 2 ms 300 KB Output is correct
36 Correct 2 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 119 ms 844 KB Output is correct
39 Correct 119 ms 1216 KB Output is correct
40 Correct 118 ms 1208 KB Output is correct
41 Correct 119 ms 1220 KB Output is correct
42 Correct 187 ms 1152 KB Output is correct
43 Correct 171 ms 1100 KB Output is correct
44 Correct 157 ms 1168 KB Output is correct
45 Correct 151 ms 1084 KB Output is correct
46 Correct 122 ms 1100 KB Output is correct
47 Correct 2 ms 332 KB Output is correct
48 Correct 23 ms 1328 KB Output is correct
49 Correct 2 ms 308 KB Output is correct
50 Correct 19 ms 1160 KB Output is correct
51 Correct 34 ms 1356 KB Output is correct
52 Correct 2 ms 308 KB Output is correct
53 Correct 26 ms 1100 KB Output is correct
54 Correct 166 ms 1188 KB Output is correct
55 Correct 144 ms 1200 KB Output is correct
56 Correct 121 ms 1212 KB Output is correct
57 Correct 105 ms 1232 KB Output is correct