oj.uz

Submission #305016

# Submission time Handle Problem Language Result Execution time Memory
305016 2020-09-22T11:57:32 Z arnold518 Packing Biscuits (IOI20_biscuits) C++14
100 / 100
 35 ms 1024 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
ll X, A[100], P[100];

ll dp[100][100];

ll solve(int bit, int con)
{
	if(bit==-1) return 1;

	ll &ret=dp[bit][con];
	if(ret!=-1) return ret;

	ll t=P[con]&((1ll<<(bit+1))-1);
	if(t>P[bit]) t=P[bit], con=bit;

	ret=0;
	if((1ll<<bit)>t)
	{
		ret+=solve(bit-1, con);
	}
	else
	{
		ret+=solve(bit-1, bit-1)+solve(bit-1, con);
	}


	//printf("%d %d : %lld\n", bit, con, ret);
	return ret;
}

ll count_tastiness(ll _X, vector<ll> _A)
{
	X=_X;
	memset(A, 0, sizeof(A));
	for(int i=0; i<_A.size(); i++) A[i]=_A[i];
 
	for(int i=0; i<60; i++) P[i]=(1ll<<i)*A[i];
	for(int i=1; i<60; i++) P[i]+=P[i-1];
	for(int i=0; i<60; i++) P[i]/=X;
	for(int i=0; i<60; i++) P[i]=min(P[i], (1ll<<(i+1))-1);

	//for(int i=0; i<60; i++) printf("%d ", P[i]); printf("\n");
 	
 	memset(dp, -1, sizeof(dp));
 	return solve(59, 59);
}

Compilation message

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:42:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |  for(int i=0; i<_A.size(); i++) A[i]=_A[i];
      |               ~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 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 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 17 ms 896 KB Output is correct
3 Correct 16 ms 1024 KB Output is correct
4 Correct 16 ms 1024 KB Output is correct
5 Correct 16 ms 896 KB Output is correct
6 Correct 16 ms 896 KB Output is correct
7 Correct 17 ms 896 KB Output is correct
8 Correct 15 ms 976 KB Output is correct
9 Correct 15 ms 896 KB Output is correct
10 Correct 14 ms 896 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 7 ms 512 KB Output is correct
38 Correct 17 ms 896 KB Output is correct
39 Correct 16 ms 1024 KB Output is correct
40 Correct 16 ms 1024 KB Output is correct
41 Correct 16 ms 896 KB Output is correct
42 Correct 16 ms 896 KB Output is correct
43 Correct 17 ms 896 KB Output is correct
44 Correct 15 ms 976 KB Output is correct
45 Correct 15 ms 896 KB Output is correct
46 Correct 14 ms 896 KB Output is correct
47 Correct 10 ms 512 KB Output is correct
48 Correct 35 ms 896 KB Output is correct
49 Correct 16 ms 512 KB Output is correct
50 Correct 31 ms 768 KB Output is correct
51 Correct 17 ms 896 KB Output is correct
52 Correct 5 ms 512 KB Output is correct
53 Correct 16 ms 896 KB Output is correct
54 Correct 21 ms 896 KB Output is correct
55 Correct 21 ms 896 KB Output is correct
56 Correct 22 ms 964 KB Output is correct
57 Correct 19 ms 896 KB Output is correct