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;
#define ll long long
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
// books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
// g++ books_sample.cpp sample_grader.cpp
// in this folder.
//
void solve(int N, int k, long long A, int S) {
int nw = 0;
for (int i = 20; i >= 0; -- i) {
int q = nw + (1 << i);
if (q > N) continue;
ll X = skim(q);/*
if (A <= X && X <= A * 2) {
answer({q});
}*/
if (X < A) {
nw = q;
}
}
if (nw < k) {
impossible();
}
ll sum = 0;
vector <int> ans;
for (int i = nw; i >= nw - k + 1; -- i) {
ans.push_back(i);
sum += skim(i);
if (A <= sum) answer(ans);
}
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... |