Submission #944296

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

books

#include <bits/stdc++.h>

#include "books.h"

using namespace std;

void solve(int N, int K, long long A, int S) {
    // TODO implement this function
    int diff[100005];

    if(skim(1) >= 2*A and K > 1){impossible();}
    if(skim(N)*K < A){impossible();}
    for(int i = 1; i <= S; i++){diff[i] = skim(i);}
    for(int mask = 0; mask < (1<<N); mask++){
        vector<int> ans;

        for(int i = 0; i < N; i++){
            if((1<<i) & mask){
                ans.push_back(diff[i]);
            }
        }
        int sum = 0;
        for(auto x: ans){
            sum += x;
        }
        if(A <= sum and sum <= 2*A) answer(ans);
        ans.clear();
    }
    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