Submission #457905

#TimeUsernameProblemLanguageResultExecution timeMemory
457905rainboyPacking Biscuits (IOI20_biscuits)C++17
9 / 100
118 ms332 KiB
#include "biscuits.h" using namespace std; typedef vector<long long> vll; const int N = 60, Z = 100000; long long max(long long a, long long b) { return a > b ? a : b; } long long count_tastiness(long long x, vll aa) { int n = aa.size(), i, cnt; long long y; cnt = 0; for (y = 0; x * y <= Z; y++) { long long a = 0; for (i = N - 1; i >= 0; i--) { if ((y & 1LL << i) != 0) a += x; a = max(a - (i < n ? aa[i] : 0), 0) * 2; } if (a == 0) cnt++; } return cnt; }
#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...