Submission #835198

#TimeUsernameProblemLanguageResultExecution timeMemory
835198DJeniUpPacking Biscuits (IOI20_biscuits)C++17
0 / 100
1046 ms1108 KiB
#include "biscuits.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; #define pb push_back #define fr first #define sc second ll res,n,d[67],k; set<ll>s; void S(ll x,ll y){ if(x==65 || ((k<<x)>y && x>=n)){ res++; return ; } y+=(d[x]<<x); if((k<<x)<=y){ S(x+1,y-(k<<x)); } S(x+1,y); return ; } long long count_tastiness(long long x, std::vector<long long> a) { res=0; n=a.size(); k=x; for(int i=0;i<=65;i++){ d[i]=0; } for(int i=0;i<n;i++){ d[i]=a[i]; } S(0,0); return res; }
#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...