Submission #1228089

#TimeUsernameProblemLanguageResultExecution timeMemory
1228089NonozePacking Biscuits (IOI20_biscuits)C++20
0 / 100
1 ms324 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); for (int i=0; i<n; i++) { if (a[i]>2) { int val=(a[i]-1)/2; a[i]-=val*2; if (i==n-1) n++, a.pb(0); a[i+1]+=val; } // cout << a[i] << ' '; } // cout << endl; int ans=1, sm=0, beg=1; for (int i=0; i<60; i++) { if (sm<(1LL<<i)-1) ans*=sm/beg+1, sm=0; if (sm==0) beg=(1LL<<i); sm+=a[i]*(1LL<<i); // cout << ans << ' ' << sm << ' ' << beg << endl; } return ans*(sm/beg+1); }
#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...