Submission #943190

#TimeUsernameProblemLanguageResultExecution timeMemory
943190theghostkingA Difficult(y) Choice (BOI21_books)C++17
0 / 100
3 ms1232 KiB
#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) {
    vector<long long> dis(N+1, -1);
    for (int i = 1; i<=N; i++){
		dis[i] = skim(i);
	}
	for (int i = 1; i<=N; i++){
		for (int j = i+1; j<=N; j++){
			for (int k = j+1; k<=N; k++){
				int sm = dis[i]+dis[j]+dis[k];
				if (sm >= A && 2*A>=sm){
					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...