# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
747735 | Rafi22 | Packing Biscuits (IOI20_biscuits) | C++14 | 1 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;
const int K=67;
ll ile[K][K];
ll count_tastiness(ll x, vector<ll>a)
{
int k=sz(a);
for(int i=0;i<k;i++)
{
ll c=0;
for(int j=i;j<k;j++)
{
c=c/2+a[j];
ile[i][j]=c;
}
}
vector<pair<ll,pair<ll,int>>>V;
V.pb({0,{0,-1}});
for(int i=0;i<k;i++)
{
for(auto [p,z]:V)
{
ll a=z.st;
int j=z.nd;
if(a>=(1LL<<i)) break;
ll q=p/(1LL<<(i-j))+ile[j+1][i];
if(q<x) break;
V.pb({q-x,{a+(1LL<<i),i}});
}
}
return sz(V);
}
/*int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout<<count_tastiness(2, {2, 1, 2});
return 0;
}*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |