Submission #1023508

#TimeUsernameProblemLanguageResultExecution timeMemory
1023508Ahmed_SolymanPacking Biscuits (IOI20_biscuits)C++14
0 / 100
1073 ms348 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; ll count_tastiness(ll x,vector<ll> a){ int k=(int)a.size(); vector<ll>g=a; int ret=0; for(int y=0;y<=100000/x;y++){ a=g; int cnt=0; for(int j=0;j<x;j++){ int u=y; for(int p=k-1;p>=0;p--){ if(a[p] && (1LL<<p)<=u){ u^=(1LL<<p); --a[p]; } } if(!u)++cnt; } ret+=(cnt==x); } return ret; }
#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...