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;
void solve(int N, int K, long long A, int S) {
vector<long long> v;
v.push_back(0);
for(int i=1; i<=N; i++){
v.push_back(skim(i));
}
for(int i=1; i<=N-2; i++)
{
long long cnt = v[i] + v[i+1] + v[i+2];
if(cnt <= A*2 && cnt >= A)
{
vector<int> ans;
ans.push_back(i);
ans.push_back(i+1);
ans.push_back(i+2);
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... |