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;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
// books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
// g++ books_sample.cpp sample_grader.cpp
// in this folder.
//
void solve(int n, int k, long long a, int s) {
/*if (x[1] == 42) {
impossible();
} else {
answer({1, 3});
}*/
vector<long long> x(n);
for (int i = 0; i < n; i++) x[i] = skim(i + 1);
long long sum = 0;
vector<int> vec;
for (int i = 0; i < k - 1; i++) sum += x[i], vec.push_back(i);
for (int i = k - 1; i < n; i++)
{
if (x[i] > a)
{
sum += x[i];
vec.push_back(i);
if (a <= sum && sum <= a * 2) answer(vec);
break;
}
}
for (int i = 0; i + k - 1 < n; i++)
{
sum = 0;
vec.clear();
for (int j = i; j <= i + k - 1; j++)
{
sum += x[j];
vec.push_back(j);
}
if (a <= sum && sum <= a * 2) answer(vec);
}
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... |