oj.uz

Submission #359333

# Submission time Handle Problem Language Result Execution time Memory
359333 2021-01-26T19:56:21 Z Jasiekstrz Packing Biscuits (IOI20_biscuits) C++17
100 / 100
 38 ms 1388 KB 
#include "biscuits.h"
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int K=60;
vector<long long> ans(K);
vector<long long> s(K);
long long _x;
inline long long cc(int i)
{
	long long xd=(s[i]/_x);
	if(xd>=(1LL<<(i+1)))
		return (1LL<<(i+1))-1;
	return xd;
}
long long f(int i,long long l)
{
	if(i==0)
	{
		if(l>0 && cc(i)>0)
			return 2;
		return 1;
	}
	if((l&(1LL<<i)) && (cc(i)&(1LL<<i)))
		return ans[i-1]+f(i-1,min(l,cc(i))^(1LL<<i));
	return f(i-1,min(l,cc(i)));
}
long long count_tastiness(long long x,vector<long long> a)
{
	_x=x;
	while(a.size()<K)
		a.push_back(0);
	s[0]=a[0];
	for(int i=1;i<K;i++)
		s[i]=(s[i-1]+(1LL<<i)*a[i]);
	for(int i=0;i<K;i++)
		ans[i]=f(i,(1LL<<(i+1))-1);
	//cerr<<ans[0]<<" "<<ans[1]<<" "<<ans[2]<<"\n";
	return ans[K-1];
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 376 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 372 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 384 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 492 KB Output is correct
2 Correct 27 ms 1260 KB Output is correct
3 Correct 27 ms 1280 KB Output is correct
4 Correct 26 ms 1272 KB Output is correct
5 Correct 27 ms 1260 KB Output is correct
6 Correct 27 ms 1224 KB Output is correct
7 Correct 27 ms 1132 KB Output is correct
8 Correct 27 ms 1132 KB Output is correct
9 Correct 27 ms 1260 KB Output is correct
10 Correct 26 ms 1216 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 376 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 372 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 376 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 17 ms 492 KB Output is correct
38 Correct 27 ms 1260 KB Output is correct
39 Correct 27 ms 1280 KB Output is correct
40 Correct 26 ms 1272 KB Output is correct
41 Correct 27 ms 1260 KB Output is correct
42 Correct 27 ms 1224 KB Output is correct
43 Correct 27 ms 1132 KB Output is correct
44 Correct 27 ms 1132 KB Output is correct
45 Correct 27 ms 1260 KB Output is correct
46 Correct 26 ms 1216 KB Output is correct
47 Correct 21 ms 492 KB Output is correct
48 Correct 38 ms 1388 KB Output is correct
49 Correct 27 ms 492 KB Output is correct
50 Correct 38 ms 1388 KB Output is correct
51 Correct 19 ms 1388 KB Output is correct
52 Correct 12 ms 492 KB Output is correct
53 Correct 18 ms 1260 KB Output is correct
54 Correct 27 ms 1260 KB Output is correct
55 Correct 28 ms 1260 KB Output is correct
56 Correct 28 ms 1260 KB Output is correct
57 Correct 27 ms 1260 KB Output is correct