Submission #1224501

#	Time	Username	Problem	Language	Result	Execution time	Memory
1224501		MarwenElarbi	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1 ms	464 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
int k;
long long num;
set<int> st;
void dfs(int i,vector<long long> vec,long long cur){
    if(i==k) {
        st.insert(cur);
        return;
    }
    long long ans=0;
    if(vec[i]>=num){
        vector<long long> tab=vec;
        tab[i]-=num;
        tab[i+1]+=tab[i]/2;
        dfs(i+1,tab,cur+(1<<i));
    }
    vector<long long> tab=vec;
    tab[i+1]+=tab[i]/2;
    dfs(i+1,tab,cur);
    return;
}
long long count_tastiness(long long x, std::vector<long long> a) {
    while(a.back()==0) a.pop_back();
    k=a.size();
    a.push_back(0);
    num=x;
    st.clear();
    dfs(0,a,0);
    return st.size();
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 21
• Subtask 4: 0 / 35
• Subtask 5: 0 / 23