Submission #1322438

#TimeUsernameProblemLanguageResultExecution timeMemory
1322438adiyerA Difficult(y) Choice (BOI21_books)C++20
5 / 100
105 ms1188 KiB
#include <bits/stdc++.h>

#include "books.h"

using namespace std;

typedef long long ll;

void solve(int n, int k, ll s, int c) {
    vector < int > ans;
    ll a[n + 1], cur = 0;
    for(int i = 1; i <= n; i++) a[i] = skim(i);
    // for(int i = 1; i <= n; i++){
    //     if(s <= a[i] && a[i] <= 2 * s){
    //         answer({i}); return;
    //     }
    // }
    // for(int i = n; i >= 1; i--){
    //     if(a[i] < s && k){
    //         cur += a[i], k--, ans.push_back(i);
    //         if(cur >= s){ answer(ans); return; }
    //     }
    // }
    for(int i = 1; i <= n; i++){
        for(int j = i + 1; j <= n; j++){
            for(int l = j + 1; l <= n; l++){
                if(s <= a[i] + a[j] + a[l] && a[i] + a[j] + a[l] <= 2 * s){
                    answer({i, j, l});
                    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...