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 "books.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
ll arr[100002];
int s, lim;
void solve(int N, int K, ll A, int S){
n = N, k = K, s = S, lim = A;
// for(int i=1; i<=n; i++) arr[i] = skim(i);
int l=1, r=n-k+1;
while(l<=r){
int m = (l+r)>>1;
ll sum = 0;
for(int i=m; i<m+k; i++) sum += skim(i);
if(sum > A+A) r=m-1;
else if(sum < A) l=m+1;
else{
vector<int> v;
for(int i=m; i<m+k; i++) v.push_back(i);
answer(v);
return;
}
}
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... |