#include <bits/stdc++.h>
#include "books.h"
typedef long long ll;
using namespace std;
const int MAXN = 1005;
ll books[MAXN];
int n;
void solve(int N, int K, long long A, int S) {
n = N;
for (int i = 1; i <= n; i++)
books[i] = skim(i);
int sum, l, r;
for (int i = 1; i <= n; i++)
{
l = i + 1, r = n;
while (l < r)
{
if (l == r)
break;
sum = books[l] + books[r] + books[i];
if (sum >= A and sum <= 2 * A)
{
vector<int> res = {i, l, r};
sort(res.begin(), res.end());
answer(res);
return;
}
if (sum < A) l++;
else if (sum > 2 * A) r--;
}
}
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... |