Submission #303493

# Submission time Handle Problem Language Result Execution time Memory
303493 2020-09-20T11:09:21 Z tutis Packing Biscuits (IOI20_biscuits) C++17
9 / 100
1000 ms 384 KB
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll count_tastiness(ll x, vector<ll> a)
{
	while (a.size() < 130)
		a.push_back(0);
	ll s[131];
	for (int i = 0; i <= 130; i++)
		s[i] = 0;
	for (int t = 1; t <= 130; t++)
	{
		s[130 - t] = s[130 - t + 1] + a[130 - t];
		if (s[130 - t] >= x)
			s[130 - t] -= x;
		for (int i = 130 - t; i < 130; i++)
		{
			s[i] *= 2;
			if (s[i] >= x)
				s[i] -= x;
		}
	}
	function<ll(ll, int)>get = [&](ll d, int i)->ll
	{
		if (i == 130)
			return 1;
		if (a[i] + d < x)
		{
			return get((d + a[i]) / 2, i + 1);
		}
		else
		{
			return get((d + a[i]) / 2, i + 1) + get((d + a[i] - x) / 2, i + 1);
		}
	};
	return get(0, 0);
}

# Verdict Execution time Memory Grader output
1 Correct 101 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 172 ms 256 KB Output is correct
5 Correct 40 ms 256 KB Output is correct
6 Correct 438 ms 364 KB Output is correct
7 Correct 26 ms 256 KB Output is correct
8 Correct 447 ms 376 KB Output is correct
9 Correct 64 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 155 ms 256 KB Output is correct
13 Correct 71 ms 256 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 105 ms 376 KB Output is correct
2 Execution timed out 1087 ms 256 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 101 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 172 ms 256 KB Output is correct
5 Correct 40 ms 256 KB Output is correct
6 Correct 438 ms 364 KB Output is correct
7 Correct 26 ms 256 KB Output is correct
8 Correct 447 ms 376 KB Output is correct
9 Correct 64 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 155 ms 256 KB Output is correct
13 Correct 71 ms 256 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 105 ms 376 KB Output is correct
16 Execution timed out 1087 ms 256 KB Time limit exceeded
17 Halted 0 ms 0 KB -