| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1224471 | MarwenElarbi | 비스킷 담기 (IOI20_biscuits) | C++17 | 1 ms | 328 KiB |
#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);
}| # | 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... | ||||
