oj.uz

Submission #670249

# Submission time Handle Problem Language Result Execution time Memory
670249 2022-12-08T12:38:02 Z jiahng Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 29 ms 1240 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define int ll
typedef pair<int,int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 200010
#define INF (ll)1e9
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;

unordered_map <int,int> dp;
int p2[121];
int A[121],X,K;
int ss[121];
int lg2(int x){
    return 63 - __builtin_clzll(x);
}
int dpf(int x){
    if (dp.find(x) != dp.end()) return dp[x];
    if (x <= 0) return 0;
    if (x == 1) return 1;
    int i = lg2(x-1);
    return dp[x] = dpf(min(ss[i] / X, x-1) - p2[i] + 1) + dpf(p2[i]);
} 

long long count_tastiness(long long x, std::vector<long long> a) {
    K = a.size(); X = x;
    FOR(i,0,K-1) A[i] = a[i];
    
    ss[0] = A[0];
    p2[0] = 1;
    FOR(i,1,59) p2[i] = p2[i-1] * 2;
    FOR(i,1,K-1){
        ss[i] = ss[i-1] + p2[i]*A[i];
    }
    FOR(i,K,60) ss[i] = ss[K-1];

    dp.clear();
    return dpf(ss[K-1]+1);
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 1 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 1 ms 304 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 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 15 ms 1104 KB Output is correct
3 Correct 14 ms 1108 KB Output is correct
4 Correct 16 ms 1116 KB Output is correct
5 Correct 17 ms 1184 KB Output is correct
6 Correct 16 ms 1112 KB Output is correct
7 Correct 15 ms 1088 KB Output is correct
8 Correct 15 ms 1108 KB Output is correct
9 Correct 15 ms 1168 KB Output is correct
10 Correct 15 ms 1168 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 0 ms 304 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 0 ms 304 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 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 1 ms 212 KB Output is correct
24 Correct 1 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 1 ms 212 KB Output is correct
28 Correct 1 ms 304 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 4 ms 340 KB Output is correct
38 Correct 15 ms 1104 KB Output is correct
39 Correct 14 ms 1108 KB Output is correct
40 Correct 16 ms 1116 KB Output is correct
41 Correct 17 ms 1184 KB Output is correct
42 Correct 16 ms 1112 KB Output is correct
43 Correct 15 ms 1088 KB Output is correct
44 Correct 15 ms 1108 KB Output is correct
45 Correct 15 ms 1168 KB Output is correct
46 Correct 15 ms 1168 KB Output is correct
47 Correct 10 ms 340 KB Output is correct
48 Correct 19 ms 1236 KB Output is correct
49 Correct 8 ms 392 KB Output is correct
50 Correct 17 ms 1148 KB Output is correct
51 Correct 13 ms 1240 KB Output is correct
52 Correct 5 ms 416 KB Output is correct
53 Correct 12 ms 1108 KB Output is correct
54 Correct 29 ms 1084 KB Output is correct
55 Correct 27 ms 1084 KB Output is correct
56 Correct 24 ms 1108 KB Output is correct
57 Correct 21 ms 1104 KB Output is correct