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;
void solve(int N, int K, long long A, int S)
{
long long a = 1, b = N - K + 1;
while (a < b)
{
long long mid = (a + b) / 2, sum = 0;
for (int i = 0; i < K; ++i)
sum += skim(mid + i);
if (A <= sum && sum <= 2 * A)
{
vector<int> v(K);
iota(v.begin(), v.end(), mid);
answer(v);
}
if (sum < A)
a = mid + 1;
else
b = mid;
}
impossible();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |