Submission #615462

#TimeUsernameProblemLanguageResultExecution timeMemory
615462Dan4LifePacking Biscuits (IOI20_biscuits)C++17
0 / 100
528 ms488 KiB
#include "biscuits.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define sz(a) (int)a.size() ll count_tastiness(ll x, vector<ll> a) { auto b = a; ll ans = 0; for(int i = 0; i <= 100000; i++){ int ok=1; a = b; for(int j = 0; j < sz(a)-1; j++){ if((i>>j)&1) a[j+1]+=max(0ll,(a[i]-x)/2), a[i]=min(a[i],x); else a[j+1]+=max(0ll, a[i]/2), a[i]%=2; } for(int j = 0; j < sz(a); j++) if((i>>j)&1 and a[j]<x)ok=0; ans+=ok; } return ans; }
#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...