oj.uz

Submission #434822

# Submission time Handle Problem Language Result Execution time Memory
434822 2021-06-21T21:06:13 Z jairRS Packing Biscuits (IOI20_biscuits) C++17
0 / 100
 1 ms 332 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

long long count_tastiness(long long x, std::vector<long long> a) {
	ll k = a.size();
	vector<ll> maxVal(k);
	maxVal[0] = a[0];
	ll sizes = a[0] + 1; //1s plus the case where there are no biscuits in the bag
	
	ll power2 = 2;
	for (int i = 1; i < k; i++)
	{
		sizes += a[i] - maxVal[i - 1]/power2; //every biscuit size not possible due to previous sums
		sizes += a[i]; //every biscuit size past maxVal[i - 1];

		power2 *= 2;
	}
	return sizes;
}

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 204 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 -