# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
863572 | TAhmed33 | A Difficult(y) Choice (BOI21_books) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <books.h>
using namespace std;
typedef long long ll;
void solve (int n, int k, ll a, int s) {
map <int, ll> dd;
int l = 1, r = n - k + 1;
int ans = -1;
while (l <= r) {
int mid = (l + r) >> 1;
long long sum = 0;
for (int i = mid; i <= mid + k - 1; i++) {
if (!dd.count(i)) dd[i] = skim(i);
sum += dd[i];
}
if (sum > 2 * a) {
r = mid - 1;
} else {
l = mid + 1; ans = mid;
}
}
if (ans == -1) impossible();
long long t = 0;
for (int i = ans; i <= ans + k - 1; i++) t += dd[i];
if (t < a) impossible();
vector <int> ret;
for (int i = ans; i <= ans + k - 1; i++) ret.push_back(i);
return ret;
}