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) {
long long arr[N+1] = {};
for(int i = 1; i <= N; i++)
{
arr[i] = skim(i);
}
for(int i = 1; i <= N; i++)
{
for(int j = i+1; j <= N; j++)
{
for(int q = j+1; q <= N; q++)
{
long long sum = arr[i]+arr[j]+arr[q];
if(sum >= A && sum <= A*2)
{
answer({i,j,q});
}
}
}
}
/*for(int i = 1; i <= N; i++)
{
arr[i] += arr[i-1];
}
for(int i = K; i <= N; i++)
{
long long sum = arr[i]-arr[i-K];
if(sum >= A && sum <= A*2)
{
for(int j = (i-K)+1; j <= i; j++)
{
ans.push_back(j);
}
break;
}
}*/
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... |