oj.uz

Submission #810531

# Submission time Handle Problem Language Result Execution time Memory
810531 2023-08-06T10:52:01 Z TimDee Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 65 ms 844 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_back
#define all(x) x.begin(), x.end()
using ll = long long;
#define pi pair<int,int>
#define f first
#define s second
#define int int64_t

map<int,int> mem;

int s[61];
int x;

int f(int n) {
    if (n<=0) return 0;
    if (n==1) return 1;
    if (mem.count(n)) return mem[n];

    int p=1;
    int i=0;
    while (2*p<n) p<<=1, ++i;
    int a = f(p);
    int b = f(min(n, s[i]/x+1)-p);
    mem[n]=a+b;
    return mem[n];
}   

ll count_tastiness(ll _x, vector<ll> a) {
    x=_x;

    mem.clear();
    forn(i,60) s[i]=0;
    s[0]=a[0];
    while (a.size()<60) a.pb(0);
    forn(i,60) if (i) s[i]=s[i-1]+(a[i]<<i);
    for (int i=0; i<=60; ++i) f(1ll<<i);
    return mem[1ll<<60];

}
#undef int

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 276 KB Output is correct
7 Correct 0 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 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 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 7 ms 340 KB Output is correct
2 Correct 21 ms 804 KB Output is correct
3 Correct 20 ms 724 KB Output is correct
4 Correct 23 ms 724 KB Output is correct
5 Correct 20 ms 828 KB Output is correct
6 Correct 24 ms 724 KB Output is correct
7 Correct 27 ms 828 KB Output is correct
8 Correct 22 ms 724 KB Output is correct
9 Correct 22 ms 824 KB Output is correct
10 Correct 15 ms 724 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 276 KB Output is correct
21 Correct 0 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 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 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 0 ms 212 KB Output is correct
33 Correct 1 ms 212 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 7 ms 340 KB Output is correct
38 Correct 21 ms 804 KB Output is correct
39 Correct 20 ms 724 KB Output is correct
40 Correct 23 ms 724 KB Output is correct
41 Correct 20 ms 828 KB Output is correct
42 Correct 24 ms 724 KB Output is correct
43 Correct 27 ms 828 KB Output is correct
44 Correct 22 ms 724 KB Output is correct
45 Correct 22 ms 824 KB Output is correct
46 Correct 15 ms 724 KB Output is correct
47 Correct 9 ms 340 KB Output is correct
48 Correct 20 ms 832 KB Output is correct
49 Correct 12 ms 372 KB Output is correct
50 Correct 15 ms 728 KB Output is correct
51 Correct 11 ms 804 KB Output is correct
52 Correct 6 ms 376 KB Output is correct
53 Correct 10 ms 736 KB Output is correct
54 Correct 65 ms 828 KB Output is correct
55 Correct 60 ms 844 KB Output is correct
56 Correct 56 ms 824 KB Output is correct
57 Correct 41 ms 832 KB Output is correct