Submission #699806

# Submission time Handle Problem Language Result Execution time Memory
699806 2023-02-18T04:05:58 Z happypotato Packing Biscuits (IOI20_biscuits) C++17
0 / 100
1 ms 312 KB
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll int> a;
ll int x;
ll int recur(int pos, ll int carry) {
	if (pos == (int)(a.size())) return 1;
	ll int cur = carry + a[pos];
	if (cur < x) {
		return recur(pos + 1, (cur >> 1));
	} else {
		return recur(pos + 1, (cur >> 1)) + recur(pos + 1, ((cur - x) >> 1));
	}
}
ll int count_tastiness(ll int x_, vector<ll int> a_) {
	a = a_; x = x_;
	return recur(0, 0);
}

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 244 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 300 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -