oj.uz

Submission #838506

# Submission time Handle Problem Language Result Execution time Memory
838506 2023-08-27T10:03:06 Z caganyanmaz Packing Biscuits (IOI20_biscuits) C++17
0 / 100
 2 ms 596 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;

//#define DEBUGGING
#ifdef DEBUGGING
#include "../debug.h"
#else
#define debug(x...) void(42)
#endif


constexpr static int MXK = 62;
constexpr static int MXADD =100;
ll count_tastiness(ll x, vector<ll> a) 
{
	assert(x == 1);
	while (a.size() < MXK-1)
		a.pb(0);
	for (int i = 0; i < MXK-2; i++)
	{
		ll change = max<ll>((a[i] - x) / 2, 0);
		a[i+1] += change;
		a[i] -= change * 2;
	}
	vector<ll> pf(MXK, 0);
	for (int i = 1; i < MXK; i++)
		pf[i] = pf[i-1]  + (a[i-1] << (i-1));
	vector<vector<ll>> dp(MXK, vector<ll>(MXADD, 0)); // Last open bit
	dp[0][0] = 1;
	for (int i = 1; i < MXK; i++)
		for (int j = 0; j < i; j++)
			for (int k = 0; k < MXADD; k++)
				if ((pf[i] - pf[j] + (k<<(j-1)) >= (x<<(i-1))))
					dp[i][((pf[i]-pf[j]+(k<<(j-1)))>>(i-1))-x] += dp[j][k];
	ll res = 0;
	for (int i = 0; i < MXK; i++)
		for (int j = 0; j < x + 2; j++)
			res += dp[i][j];
	debug(dp, res);
	return res;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 296 KB Output is correct
2 Incorrect 2 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

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