# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
304615 | 2020-09-21T15:24:46 Z | medmdg | Packing Biscuits (IOI20_biscuits) | C++14 | 1 ms | 640 KB |
#include <bits/stdc++.h> #include "biscuits.h" using namespace std; long long int count_tastiness(long long int x,vector<long long int> a){ long long int b[61]; int k=61; bool an[k]; memset(b,0,61); for(int i=0;i<a.size();i++) b[i]=a[i]; memset(an,false,k); for(int i=0;i<61;i++){ if(b[i]>=x){ an[i]=true; b[i]-=x; }else{ an[i]=false; } b[i+1]+=b[i]/2; b[i]=0; } unsigned long long int ans=0; for(int i=0;i<61;i++){ if(an[i]) ans+=1<<i; } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 640 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |