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) {
// TODO implement this function
int l = 1, r = N-K+1, m, ans = -1;
while(l < r) {
m = (l+r)/2;
int sm = 0;
for(int i = 0; i < K; i++) sm += skim(m+i);
if(sm < A) l = m+1;
else {
if(sm <= 2*A) ans = m;
r = m;
}
}
if(ans == -1) impossible();
else {
vector<int> v;
for(int i = 0; i < K; i++) v.push_back(ans+i);
answer(v);
}
}
# | 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... |