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 a[N+1], cur = 0;
for(int i = 1; i <= N; i++) a[i] = skim(i);
for(int i = 1; i <= K; i++) cur += a[i];
if(cur >= A && cur <= 2*A) {
for(int j = K; j > 0; j--) v.push_back(j);
answer(v);
} else if(cur >= A) impossible();
for(int i = K+1; i <= N; i++) {
cur += a[i]-a[i-K];
if(cur >= A && cur <= 2*A) {
for(int j = i; j > i-K; j--) v.push_back(j);
answer(v);
} else if(cur >= A) {
assert(a[i] >= A);
int sm = 0;
for(int j = 1; j < K; j++) {
sm += a[j];
v.push_back(j);
}
sm += a[i];
v.push_back(i);
if(sm <= 2*A) answer(v);
else impossible();
}
}
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... |