# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528400 | 79brue | A Difficult(y) Choice (BOI21_books) | C++14 | 0 ms | 0 KiB |
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"
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);
for(int i=1; i<=n-k+1; i++){
ll sum = 0;
for(int j=i; j<i+k; j++) sum += arr[j];
if(A <= sum && sum <= A+A){
vector<int> v;
for(int j=i; j<i+k; j++) v.push_back(j);
answer(v);
return;
}
}
exit(1);
impossible();
}