제출 #1224471

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1224471		MarwenElarbi	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1 ms	328 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
int k;
int num;
long long dfs(int i,vector<long long> vec){
    if(i==k) return 1;
    long long ans=0;
    if(vec[i]>=num){
        vector<long long> tab=vec;
        tab[i]-=num;
        tab[i+1]+=tab[i]/2;
        ans+=dfs(i+1,tab);
    }
    vector<long long> tab=vec;
    tab[i+1]+=tab[i]/2;
    ans+=dfs(i+1,tab);
    return ans;
}
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;
    return dfs(0,a);
}

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