Submission #799534

#TimeUsernameProblemLanguageResultExecution timeMemory
799534M7kraA Difficult(y) Choice (BOI21_books)C++17
0 / 100
0 ms256 KiB
#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 (N != 3) {
        impossible();
        return;
    }

    vector<long long> books(N);
    for (int i = 0; i < N; i++) books[i] = skim(i);

    for (int i = 0; i < N; i++) {
        for (int j = 0; j < i; j++) {
            for (int k = 0; k < j; k++) {
                long long value = books[i] + books[j] + books[k];
                if (value >= A && value <= 2 * A) answer({i, j, k});
            }
        }
    }
    impossible();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...