oj.uz

Submission #923901

# Submission time Handle Problem Language Result Execution time Memory
923901 2024-02-08T05:49:16 Z winter0101 Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 756 ms 1876 KB 
#include<bits/stdc++.h>
#include "biscuits.h"
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
long long mx[61];
map<long long,long long>f[61];
long long cal(long long val,int bit){
if (bit==0){
return f[bit][val]=min(val,mx[bit])+1;
}
if (f[bit].find(val)!=f[bit].end())return f[bit][val];
long long ans=cal(val,bit-1);
if (val>=(1ll<<bit)&&mx[bit]>=(1ll<<bit)){
ans+=cal(min(val-(1ll<<bit),mx[bit]-(1ll<<bit)),bit-1);
}
return f[bit][val]=ans;
}
long long count_tastiness(long long x, std::vector<long long> a) {
    while (sz(a)<60)a.pb(0);
	int n=sz(a);
	long long sum=0;
	for1(i,0,n-1){
	sum+=(1ll<<i)*a[i];
	mx[i]=min(sum/x,(1ll<<(i+1))-1);
	f[i].clear();
	}
	return cal(mx[59],59);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 464 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 2 ms 348 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 440 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 5 ms 604 KB Output is correct
11 Correct 8 ms 604 KB Output is correct
12 Correct 11 ms 860 KB Output is correct
13 Correct 9 ms 860 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 348 KB Output is correct
2 Correct 82 ms 1376 KB Output is correct
3 Correct 79 ms 1392 KB Output is correct
4 Correct 77 ms 1368 KB Output is correct
5 Correct 74 ms 1376 KB Output is correct
6 Correct 89 ms 1384 KB Output is correct
7 Correct 90 ms 1116 KB Output is correct
8 Correct 86 ms 1332 KB Output is correct
9 Correct 86 ms 1112 KB Output is correct
10 Correct 52 ms 1340 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 464 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 3 ms 604 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 3 ms 604 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 856 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 344 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 440 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 5 ms 604 KB Output is correct
34 Correct 8 ms 604 KB Output is correct
35 Correct 11 ms 860 KB Output is correct
36 Correct 9 ms 860 KB Output is correct
37 Correct 14 ms 348 KB Output is correct
38 Correct 82 ms 1376 KB Output is correct
39 Correct 79 ms 1392 KB Output is correct
40 Correct 77 ms 1368 KB Output is correct
41 Correct 74 ms 1376 KB Output is correct
42 Correct 89 ms 1384 KB Output is correct
43 Correct 90 ms 1116 KB Output is correct
44 Correct 86 ms 1332 KB Output is correct
45 Correct 86 ms 1112 KB Output is correct
46 Correct 52 ms 1340 KB Output is correct
47 Correct 42 ms 572 KB Output is correct
48 Correct 208 ms 1628 KB Output is correct
49 Correct 116 ms 656 KB Output is correct
50 Correct 194 ms 1484 KB Output is correct
51 Correct 8 ms 1368 KB Output is correct
52 Correct 3 ms 348 KB Output is correct
53 Correct 7 ms 1116 KB Output is correct
54 Correct 756 ms 1876 KB Output is correct
55 Correct 603 ms 1668 KB Output is correct
56 Correct 470 ms 1580 KB Output is correct
57 Correct 322 ms 1616 KB Output is correct