Submission #917377

#TimeUsernameProblemLanguageResultExecution timeMemory
917377Darren0724A Difficult(y) Choice (BOI21_books)C++17
5 / 100
130 ms1232 KiB
#include <bits/stdc++.h>
#include "books.h"
//#include "grader.cpp"
using namespace std;


void solve(int n, int k, long long A, int s) {
    vector<long long> v(n+1);
    for(int i=1;i<=n;i++){
        v[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++){
                if(v[i]+v[j]+v[k]>=A&&v[i]+v[j]+v[k]<=2*A){
                    answer({i,j,k});
                    return;
                }
            }
        }
    }

    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...