oj.uz

답안 #365269

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
365269 2021-02-11T11:02:12 Z valerikk 비스킷 담기 (IOI20_biscuits) C++17
100 / 100
 96 ms 1516 KB 
#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

ll x;
int k;
ll sum[64];
ll a[64];
map<ll, ll> mp;

ll f(ll n) {
    if (n < 0)
        return 0;
    if (n == 0)
        return 1;
    if (mp.count(n))
        return mp[n];
    mp[n] = 0;
    ll& ret = mp[n];
    int i = 0;
    while ((1ll << (i + 1)) <= n)
        i++;
    ret += f((1ll << i) - 1);
    ll mx = min(n, sum[i] / x);
    ret += f(mx - (1ll << i));
    return ret;
}

ll count_tastiness(ll xx, vector<ll> aa) {
    x = xx;
    k = 60;
    while ((int)aa.size() < k) 
        aa.push_back(0);
    for (int i = 0; i < k; i++) 
        a[i] = aa[i];
    for (int i = 0; i < k; i++) {
        sum[i] = a[i] * (1ll << i);
        if (i != 0)
            sum[i] += sum[i - 1];
    }
    mp.clear();
    return f((1ll << k) - 1);
}

#ifdef LOCAL
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int kk;
    ll xx;
    cin >> kk >> xx;
    vector<ll> aa(kk);
    for (int i = 0; i < kk; i++)
        cin >> aa[i];
    cout << count_tastiness(xx, aa) << endl;
    return 0;
}
#endif

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 376 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 512 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 512 KB Output is correct
2 Correct 30 ms 1260 KB Output is correct
3 Correct 29 ms 1260 KB Output is correct
4 Correct 29 ms 1260 KB Output is correct
5 Correct 28 ms 1280 KB Output is correct
6 Correct 38 ms 1132 KB Output is correct
7 Correct 38 ms 1260 KB Output is correct
8 Correct 47 ms 1132 KB Output is correct
9 Correct 34 ms 1260 KB Output is correct
10 Correct 24 ms 1260 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 376 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 2 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 2 ms 364 KB Output is correct
36 Correct 2 ms 512 KB Output is correct
37 Correct 11 ms 512 KB Output is correct
38 Correct 30 ms 1260 KB Output is correct
39 Correct 29 ms 1260 KB Output is correct
40 Correct 29 ms 1260 KB Output is correct
41 Correct 28 ms 1280 KB Output is correct
42 Correct 38 ms 1132 KB Output is correct
43 Correct 38 ms 1260 KB Output is correct
44 Correct 47 ms 1132 KB Output is correct
45 Correct 34 ms 1260 KB Output is correct
46 Correct 24 ms 1260 KB Output is correct
47 Correct 13 ms 492 KB Output is correct
48 Correct 28 ms 1516 KB Output is correct
49 Correct 15 ms 492 KB Output is correct
50 Correct 32 ms 1260 KB Output is correct
51 Correct 19 ms 1388 KB Output is correct
52 Correct 10 ms 492 KB Output is correct
53 Correct 20 ms 1260 KB Output is correct
54 Correct 96 ms 1260 KB Output is correct
55 Correct 89 ms 1260 KB Output is correct
56 Correct 78 ms 1388 KB Output is correct
57 Correct 64 ms 1260 KB Output is correct