oj.uz

Submission #469051

# Submission time Handle Problem Language Result Execution time Memory
469051 2021-08-30T14:10:12 Z blue Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 110 ms 1316 KB 
#include "biscuits.h"
#include <vector>
#include <iostream>
#include <map>
using namespace std;

//x = number of people (p)
//y = tastiness of each bag (i)

const int mx = 64;

long long pow2[mx];

long long* sm = new long long[1+mx] + 1;

map<long long, long long> CT;


long long X;
vector<long long> A;

int I(long long z)
{
    int I = 0;
    while(pow2[I+1] <= z) I++;
    return I;
}

long long Count(long long z)
{
    // cerr << "count " << z << '\n';
    if(z < 0) return 0;
    else if(z == 0) return 1;
    int i = I(z);

    if(CT.find(z) == CT.end())
    {
        CT[z] = Count(pow2[i] - 1) + Count(min(sm[i]/X - pow2[i], z - pow2[i]));
    }
    return CT[z];
 }

long long count_tastiness(long long x, vector<long long> a)
{
    while((int)a.size() < mx) a.push_back(0);

    CT.clear();

    pow2[0] = 1;
    for(int i = 1; i < mx; i++) pow2[i] = 2LL * pow2[i-1];
    sm[-1] = 0;
    for(int i = 0; i < mx; i++)
        sm[i] = sm[i-1] + pow2[i]*a[i];

    X = x;
    A = a;

    return Count(sm[mx-1]/x);
}

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 332 KB Output is correct
3 Correct 0 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 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 320 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 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 2 ms 332 KB Output is correct
13 Correct 2 ms 204 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 332 KB Output is correct
2 Correct 27 ms 808 KB Output is correct
3 Correct 25 ms 716 KB Output is correct
4 Correct 35 ms 716 KB Output is correct
5 Correct 25 ms 820 KB Output is correct
6 Correct 40 ms 804 KB Output is correct
7 Correct 41 ms 716 KB Output is correct
8 Correct 30 ms 716 KB Output is correct
9 Correct 30 ms 796 KB Output is correct
10 Correct 20 ms 816 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 332 KB Output is correct
3 Correct 0 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 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 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 320 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 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 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 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 2 ms 204 KB Output is correct
37 Correct 5 ms 332 KB Output is correct
38 Correct 27 ms 808 KB Output is correct
39 Correct 25 ms 716 KB Output is correct
40 Correct 35 ms 716 KB Output is correct
41 Correct 25 ms 820 KB Output is correct
42 Correct 40 ms 804 KB Output is correct
43 Correct 41 ms 716 KB Output is correct
44 Correct 30 ms 716 KB Output is correct
45 Correct 30 ms 796 KB Output is correct
46 Correct 20 ms 816 KB Output is correct
47 Correct 8 ms 392 KB Output is correct
48 Correct 28 ms 1316 KB Output is correct
49 Correct 14 ms 332 KB Output is correct
50 Correct 27 ms 1176 KB Output is correct
51 Correct 14 ms 1292 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 9 ms 1096 KB Output is correct
54 Correct 110 ms 1100 KB Output is correct
55 Correct 90 ms 1100 KB Output is correct
56 Correct 76 ms 1192 KB Output is correct
57 Correct 60 ms 1216 KB Output is correct