oj.uz

Submission #748136

# Submission time Handle Problem Language Result Execution time Memory
748136 2023-05-25T12:34:12 Z Rafi22 Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 410 ms 18596 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

ll P[67];

map<pair<int,ll>,ll>mem;
map<pair<int,ll>,bool>was;

ll f(int i,ll x)
{
    x=min(x,(1LL<<(i+1))-1);

    if(i==0) return x+1;
    if(was[{i,x}]) return mem[{i,x}];
    ll ans=0;
    if(x&(1LL<<i)) ans=f(i-1,P[i-1])+f(i-1,min(P[i-1],x-(1LL<<i)));
    else ans=f(i-1,min(x,P[i-1]));
    was[{i,x}]=1;
    return mem[{i,x}]=ans;
}

ll count_tastiness(ll x, vector<ll>w)
{
    int k=sz(w);
    P[0]=w[0];
    for(int i=1;i<60;i++)
    {
        P[i]=P[i-1];
        if(i<k) P[i]+=w[i]*(1LL<<i);
    }
    for(int i=0;i<60;i++) P[i]/=x;
    was.clear();
    return f(59,P[59]);
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 564 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 3 ms 468 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3540 KB Output is correct
2 Correct 107 ms 10152 KB Output is correct
3 Correct 101 ms 10204 KB Output is correct
4 Correct 110 ms 10044 KB Output is correct
5 Correct 112 ms 9676 KB Output is correct
6 Correct 99 ms 7564 KB Output is correct
7 Correct 133 ms 7460 KB Output is correct
8 Correct 107 ms 7800 KB Output is correct
9 Correct 103 ms 8052 KB Output is correct
10 Correct 87 ms 7464 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 240 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 304 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 564 KB Output is correct
35 Correct 4 ms 596 KB Output is correct
36 Correct 3 ms 468 KB Output is correct
37 Correct 20 ms 3540 KB Output is correct
38 Correct 107 ms 10152 KB Output is correct
39 Correct 101 ms 10204 KB Output is correct
40 Correct 110 ms 10044 KB Output is correct
41 Correct 112 ms 9676 KB Output is correct
42 Correct 99 ms 7564 KB Output is correct
43 Correct 133 ms 7460 KB Output is correct
44 Correct 107 ms 7800 KB Output is correct
45 Correct 103 ms 8052 KB Output is correct
46 Correct 87 ms 7464 KB Output is correct
47 Correct 34 ms 3540 KB Output is correct
48 Correct 61 ms 4524 KB Output is correct
49 Correct 42 ms 3584 KB Output is correct
50 Correct 59 ms 4300 KB Output is correct
51 Correct 17 ms 1236 KB Output is correct
52 Correct 8 ms 344 KB Output is correct
53 Correct 14 ms 1084 KB Output is correct
54 Correct 410 ms 18596 KB Output is correct
55 Correct 344 ms 17932 KB Output is correct
56 Correct 306 ms 16056 KB Output is correct
57 Correct 280 ms 13684 KB Output is correct