oj.uz

Submission #834668

# Submission time Handle Problem Language Result Execution time Memory
834668 2023-08-22T16:53:15 Z Johann Packing Biscuits (IOI20_biscuits) C++14
44 / 100
 150 ms 3540 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;
ll A[200200];

long long count_tastiness(long long _X, std::vector<long long> a)
{
	X = _X;
	vector<ll> S(sz(a) + 1, 0);
	ll 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;
	A[0] = 0;
	base = 1;
	for (int i = 0; base * X <= S.back(); ++i)
	{
		ll size = ans;
		ll bound = (i < sz(S)) ? S[i] : S.back();
		for (int j = 0; j < size; ++j)
		{
			ll y = A[j];
			if ((y + base) * X <= bound)
				A[ans++] = y + base;
			else
				break;
		}
		base *= 2;
	}

	return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Runtime error 3 ms 3540 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 3540 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 2132 KB Output is correct
2 Correct 140 ms 2388 KB Output is correct
3 Correct 138 ms 2644 KB Output is correct
4 Correct 134 ms 2744 KB Output is correct
5 Correct 135 ms 2740 KB Output is correct
6 Correct 150 ms 2688 KB Output is correct
7 Correct 142 ms 2700 KB Output is correct
8 Correct 143 ms 2692 KB Output is correct
9 Correct 141 ms 2648 KB Output is correct
10 Correct 143 ms 2644 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 0 ms 464 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Runtime error 3 ms 3540 KB Execution killed with signal 11
17 Halted 0 ms 0 KB -