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"
#ifdef CYBER
#include "grader.cpp"
#endif
#define lg long long
using namespace std;
void solve(int N, int K, long long A, int S)
{
vector<lg> v(N);
for(int i = 1; i <= N; i++)
{
v[i] = skim(i)+v[i-1];
}
vector<int> ans;
for(int i = K; i <= N; i++)
{
if(A <= v[i]-v[i-K] && v[i]-v[i-K] <= 2*A)
{
for(int j = i-K+1; j <= i; j++) ans.push_back(j);
break;
}
}
if(ans.empty()) impossible();
answer(ans);
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... |