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);
for (int i = 0; i < n - 2; i++)
{
for (int j = i + 1; j < n - 1; j++)
{
long long sum = x[i] + x[j];
if (sum > 2 * a) break;
// sum + num <= 2 * a
// num <= 2 * a - sum
auto it = lower_bound(x.begin() + j + 1, x.end(), a * 2 - sum);
if (it == x.end()) continue;
int id = it - x.begin();
sum += x[id];
if (a <= sum && sum <= 2 * a) answer({ i + 1, j + 1, id + 1 });
}
}
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... |