# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
400335 | 2021-05-07T21:53:32 Z | REALITYNB | Packing Biscuits (IOI20_biscuits) | C++14 | 2 ms | 508 KB |
#include <bits/stdc++.h> #include "biscuits.h" #define int long long using namespace std; int count_tastiness(int x ,vector<int> a){ int n =a.size()*2; while(a.size()!=n) a.push_back(0) ; vector<int> dp(n+1) ; dp[n]=1; for(int i=0;i<n;i++){ vector<int> b = a ; int stop=i; for(int j=i;j<n;j++){ if(b[j]>1){ b[j+1]+=b[j]/2 ; if(b[j]&1) b[j]=1; else b[j]=0; stop=j+1; } else break ; } for(int j=i;j<stop;j++){ if(b[j]==1){ dp[i]+=dp[stop]*(1<<(j-i)) ; } } } return dp[0] ; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 296 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 508 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |