Submission #846756

#	Time	Username	Problem	Language	Result	Execution time	Memory
846756		MinaRagy06	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	1 ms	828 KiB

books

#include <bits/stdc++.h>
#ifdef MINA
#include "grader.cpp"
#endif
#include "books.h"
#define ll long long
using namespace std;

void solve(int n, int k, ll a, int s) {
    int b[n];
    for (int i = 0; i < n; i++) {
        b[i] = skim(i + 1);
    }
    vector<int> ans;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            int idx = lower_bound(b + j + 1, b + n, a - b[i] - b[j]) - b;
            if (idx == n) continue;
            if (b[i] + b[j] + b[idx] <= 2 * a) {
                answer({i + 1, j + 1, idx + 1});
                return;
            }
        }
    }
    impossible();
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20