Submission #305758

#TimeUsernameProblemLanguageResultExecution timeMemory
305758arthurconmyPacking Biscuits (IOI20_biscuits)C++14
0 / 100
316 ms38136 KiB
#ifndef ARTHUR_LOCAL #include "biscuits.h" #endif #include <bits/stdc++.h> using namespace std; using ll = long long; #define len(x) int((x).size()) ll dp[101][40001]; ll count_tastiness(ll x, vector<ll> A) { while(len(A) <= 100) A.push_back(0LL); for(int i=0; i<len(A); i++) { if(A[i] > x) { ll pass_up = ll((A[i]-x)/2LL); A[i] -= 2LL*pass_up; A[i+1] += pass_up; } } dp[0][0] = 1LL; for(int b=0; b<=99; b++) { // transition up from dp[b] using 1<<b // case 1: don't add the zero for(int i=0; i<=40000; i++) { dp[b+1][int(i/2) + A[b]] += dp[b][i]; } for(int i=0; i<=40000; i++) { if(A[b] + int(i/2) >= x) { dp[b+1][int(i/2) + A[b] - x] += dp[b][i]; } } } ll ans=0LL; for(int i=0; i<=40000; i++) { ans += dp[100][i]; } return ans; } #ifdef ARTHUR_LOCAL int main() { cout << count_tastiness(1, {1000000000000000000LL,1LL}) << endl; } #endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...