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) {
vector<int> v;
#define int long long
int l = 1, r = N-K+1, m;
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 r = m;
}
int sm = 0;
for(int i = 0; i < K; i++) sm += skim(l+i);
if(sm >= A && sm <= 2*A) {
for(int i = 0; i < K; i++) v.push_back(l+i);
answer(v);
} else impossible();
#undef int
}
# | 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... |