Submission #1228033

#TimeUsernameProblemLanguageResultExecution timeMemory
1228033NonozePacking Biscuits (IOI20_biscuits)C++20
0 / 100
1095 ms320 KiB
#include "biscuits.h" #include <bits/stdc++.h> #define fi first #define se second #define pb push_back #define cmin(a, b) a=min(a, b) #define cmax(a, b) a=max(a, b) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(x) (int)x.size() using namespace std; #define int long long int count_tastiness(int x, vector<int> a) { int n=sz(a); int mx=0; for (int i=0; i<n; i++) mx+=(1<<i)*a[i]; vector<int> pref(1, 0); for (int i=0; i<n; i++) pref.pb(pref.back()+a[i]); vector<int> b=a; int ans=1; for (int y=1; y<=mx; y++) { a=b; int emplbeg=n-1; while ((1<<emplbeg)>y) emplbeg--; bool ok=1; for (int i=0; i<x; i++) { int val=y, empl=emplbeg; while (val && empl>=0 && pref[i]+a[i]>=(x-i)) { if ((1<<empl)>val || !a[empl]) empl--; else a[empl]--, val-=(1<<empl); } if (val) { ok=0; break; } } 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...