oj.uz

Submission #429765

# Submission time Handle Problem Language Result Execution time Memory
429765 2021-06-16T09:18:52 Z dreezy Packing Biscuits (IOI20_biscuits) C++17
0 / 100
 1 ms 332 KB 
#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std;
/* subtask1 : brutazo*/
/*subtask 2 easy brutazo*/
#define ll long long

/***

answer is you either chose a bit or you dont
but, when we have multiple of the same bits we get repetition
we need to count how many times that happens


if they were all differente then answer is

a.size() chose x

we need to count repetitions

2^2 + 2^2 + 2^4 == 8 + 16 = 24

2^3 + 2^3 + 2^3 = 8 + 8 + 8 = 16

*/

long long count_tastiness(long long x, vector<long long> a) {
	ll ans = 0;
	
	//vector that stores how many bits we can use to make this power of two
	
	 for(ll pow : a)
			ans+= pow!= 0;
	
	return ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 292 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -