Submission #1018725

#TimeUsernameProblemLanguageResultExecution timeMemory
1018725j_vdd16Packing Biscuits (IOI20_biscuits)C++17
0 / 100
1078 ms436 KiB
#include <algorithm> #include <bitset> #include <cstdint> #include <cstring> #include <iostream> #include <limits.h> #include <math.h> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <string> #include <vector> //#define int long long #define ll long long #define loop(X, N) for(int X = 0; X < (N); X++) #define all(V) V.begin(), V.end() #define rall(V) V.rbegin(), V.rend() using namespace std; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int, int> ii; typedef vector<ii> vii; typedef vector<vector<ii>> vvii; typedef vector<bool> vb; typedef vector<vector<bool>> vvb; ll count_tastiness(ll x, vector<ll> a) { constexpr ll N = 61; a.resize(N, 0); ll sum = 0; loop(i, N) sum += a[i] * (1LL << i); ll result = 0; loop(y, sum + 1) { bool success = true; ll count = 0; loop(bit, N) { count += a[bit] * (1LL << bit); if ((y & (1LL << bit)) == 0) continue; if (count < x * (1LL << bit)) { success = false; break; } count -= x * (1LL << bit); } //cout << y << ": " << success << endl; result += success; } return result; }
#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...