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 i64 = long long;
void solve(int n, int k, i64 A, int s) {
std::vector<i64> a(n);
for (int i = 0; i < n; i++) {
a[i] = skim(i + 1);
}
for (int i = k - 1; i < n; i++) {
i64 sum = 0;
for (int j = i - k + 1; j <= i; j++) {
sum += a[j];
}
if (sum >= A && sum <= 2 * A) {
std::vector<int> ans;
for (int j = i - k + 1; j <= i; j++) {
ans.push_back(j + 1);
}
answer(ans);
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... |