oj.uz

Submission #749792

# Submission time Handle Problem Language Result Execution time Memory
749792 2023-05-28T13:43:51 Z bachhoangxuan Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 22 ms 1320 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define fi first
#define se second

long long count_tastiness(long long x, std::vector<long long> a) {
	int k=60;a.resize(k);
    for(int i=1;i<k;i++) a[i]=a[i]*(1LL<<i)+a[i-1];
    for(int i=0;i<k;i++) a[i]/=x,a[i]=min(a[i],(1LL<<(i+1))-1);
    vector<pii> cur;cur.push_back({min(a[k-1],(1LL<<k)-1),1});
    for(int i=k-1;i>=0;i--){
        vector<pii> nw;
        int sum=0;
        for(pii x:cur){
            nw.push_back({min(x.fi&((1LL<<i)-1),(i==0?0:a[i-1])),x.se});
            if(x.fi>=(1LL<<i)) sum+=x.se;
        }
        if(sum!=0) nw.push_back({min((1LL<<i)-1,(i==0?0:a[i-1])),sum});
        cur.clear();sort(nw.begin(),nw.end());
        for(pii x:nw){
            if(cur.empty() || x.fi!=cur.back().fi) cur.push_back(x);
            else cur.back().se+=x.se;
        }
    }
    return (cur.empty()?0:cur[0].se);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 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 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 300 KB Output is correct
9 Correct 1 ms 296 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
14 Correct 1 ms 296 KB Output is correct

Subtask #2
12.0 / 12.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 212 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 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 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 300 KB Output is correct
13 Correct 1 ms 300 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 15 ms 1112 KB Output is correct
3 Correct 21 ms 1108 KB Output is correct
4 Correct 14 ms 1108 KB Output is correct
5 Correct 15 ms 1108 KB Output is correct
6 Correct 22 ms 1080 KB Output is correct
7 Correct 16 ms 1152 KB Output is correct
8 Correct 21 ms 1108 KB Output is correct
9 Correct 14 ms 1080 KB Output is correct
10 Correct 14 ms 1168 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 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 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 300 KB Output is correct
9 Correct 1 ms 296 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
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 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 304 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 304 KB Output is correct
26 Correct 1 ms 296 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 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 300 KB Output is correct
36 Correct 1 ms 300 KB Output is correct
37 Correct 5 ms 340 KB Output is correct
38 Correct 15 ms 1112 KB Output is correct
39 Correct 21 ms 1108 KB Output is correct
40 Correct 14 ms 1108 KB Output is correct
41 Correct 15 ms 1108 KB Output is correct
42 Correct 22 ms 1080 KB Output is correct
43 Correct 16 ms 1152 KB Output is correct
44 Correct 21 ms 1108 KB Output is correct
45 Correct 14 ms 1080 KB Output is correct
46 Correct 14 ms 1168 KB Output is correct
47 Correct 6 ms 404 KB Output is correct
48 Correct 14 ms 1320 KB Output is correct
49 Correct 16 ms 404 KB Output is correct
50 Correct 13 ms 1184 KB Output is correct
51 Correct 12 ms 1300 KB Output is correct
52 Correct 4 ms 416 KB Output is correct
53 Correct 9 ms 1108 KB Output is correct
54 Correct 21 ms 1108 KB Output is correct
55 Correct 21 ms 1184 KB Output is correct
56 Correct 20 ms 1108 KB Output is correct
57 Correct 18 ms 1108 KB Output is correct