Submission #658797

#TimeUsernameProblemLanguageResultExecution timeMemory
6587971zaid1A Difficult(y) Choice (BOI21_books)C++17
0 / 100
1 ms208 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; map<int, long long> fr; long long ski(int p) { if (!fr[p]) fr[p] = skim(p); return fr[p]; } void solve(int n, int k, long long a, int s) { vector<int> v; for (int i = k; i >= 1; i--) v.push_back(i); int sum = 0; for (int i:v) sum += ski(i); int i = n; for (int &x:v) { int p = (1<<17); sum -= ski(x); while (p /= 2) { if (x+p < i && sum + ski(x+p) <= 2*a) x += p; } sum += ski(x); i = x; } answer(v); } /* */
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...