oj.uz

Submission #610669

# Submission time Handle Problem Language Result Execution time Memory
610669 2022-07-28T12:05:14 Z Mounir Packing Biscuits (IOI20_biscuits) C++14
9 / 100
 1000 ms 372 KB 
#include "biscuits.h"
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
#define pb push_back
#define pii pair<int, int>
#define sz(x) (int)x.size()
#define x first
#define y second;
#define int long long
using namespace std;

int nBags;

int solve(vector<int> pow2){
	if (sz(pow2) == 0)
		return 1;
	
	if (pow2.back() == 0){
		pow2.pop_back();
		int res = solve(pow2);
		pow2.pb(0);
		return res;
	}

	int cur = pow2.back(), res = 0;
	pow2.pop_back();
	for (int bit = 0; bit < 2; ++bit){
		if (cur < bit * nBags) continue;
		int toAdd = (cur - bit * nBags)/2;
		if (pow2.empty())
			pow2.pb(0);
		pow2[sz(pow2) - 1] += toAdd;
		res += solve(pow2);
		pow2[sz(pow2) - 1] -= toAdd;
	}
	pow2.pb(cur);
	return res;
}

int count_tastiness(int x, vector<int> nOccs) {
	reverse(all(nOccs));
	nBags = x;
	return solve(nOccs);
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 292 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 24 ms 280 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 61 ms 212 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 68 ms 276 KB Output is correct
9 Correct 8 ms 296 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 146 ms 316 KB Output is correct
13 Correct 61 ms 304 KB Output is correct
14 Correct 6 ms 316 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 300 KB Output is correct
2 Execution timed out 1080 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1040 ms 304 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 372 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 292 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 24 ms 280 KB Output is correct
5 Correct 6 ms 212 KB Output is correct
6 Correct 61 ms 212 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 68 ms 276 KB Output is correct
9 Correct 8 ms 296 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 146 ms 316 KB Output is correct
13 Correct 61 ms 304 KB Output is correct
14 Correct 6 ms 316 KB Output is correct
15 Correct 11 ms 300 KB Output is correct
16 Execution timed out 1080 ms 212 KB Time limit exceeded
17 Halted 0 ms 0 KB -