# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474115 | Cross_Ratio | Packing Biscuits (IOI20_biscuits) | C++14 | 1092 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
long long cnt = 0;
long long int X;
long long int backtrack(int N, vector<long long> A) {
long long int ans = 0;
vector<long long> A1 = A;
if(A1[N] >= X) {
A1[N] -= X;
if(N == A1.size() - 1) A1.push_back(A1[N]/2);
else A1[N+1] += A1[N]/2;
ans += backtrack(N+1,A1);
}
if(N == A.size() - 1) {
if(A[N] < X) return 1;
A.push_back(A[N]/2);
}
else A[N+1] += A[N] / 2;
ans += backtrack(N+1,A);
//cout << N <<" : " << ans << '\n';
return ans;
}
long long count_tastiness(long long x, vector<long long> a) {
X = x;
return backtrack(0,a);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |