Submission #834659

# Submission time Handle Problem Language Result Execution time Memory
834659 2023-08-22T16:40:53 Z Johann Packing Biscuits (IOI20_biscuits) C++14
9 / 100
1000 ms 1566712 KB
#include "biscuits.h"
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

ll X;

long long count_tastiness(long long _X, std::vector<long long> a)
{
	X = _X;
	vector<__int128_t> S(sz(a) + 1, 0);
	__int128_t base = 1;
	for (int i = 0; i < sz(a); ++i)
	{
		S[i] += a[i] * base;
		S[i + 1] += S[i];
		base *= 2;
	}

	ll ans = 1;
	vector<__int128_t> A(1, 0);
	base = 1;
	for (int i = 0; base * X <= S.back(); ++i)
	{
		ll size = sz(A);
		__int128_t bound = (i < sz(S)) ? S[i] : S.back();
		for (int j = 0; j < size; ++j)
		{
			__int128_t y = A[j];
			if ((y + base) * X <= bound)
				A.push_back(y + base), ++ans;
		}
		base *= 2;
	}

	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2376 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 1864 KB Output is correct
5 Correct 2 ms 708 KB Output is correct
6 Correct 6 ms 3920 KB Output is correct
7 Correct 1 ms 516 KB Output is correct
8 Correct 5 ms 3860 KB Output is correct
9 Correct 2 ms 728 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 3 ms 1128 KB Output is correct
13 Correct 1 ms 680 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2376 KB Output is correct
2 Execution timed out 1121 ms 1296848 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1109 ms 1566712 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 873 ms 7728 KB Output is correct
2 Execution timed out 1038 ms 8592 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2376 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 1864 KB Output is correct
5 Correct 2 ms 708 KB Output is correct
6 Correct 6 ms 3920 KB Output is correct
7 Correct 1 ms 516 KB Output is correct
8 Correct 5 ms 3860 KB Output is correct
9 Correct 2 ms 728 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 3 ms 1128 KB Output is correct
13 Correct 1 ms 680 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 2376 KB Output is correct
16 Execution timed out 1121 ms 1296848 KB Time limit exceeded
17 Halted 0 ms 0 KB -