Submission #646246

#	Time	Username	Problem	Language	Result	Execution time	Memory
646246		alextodoran	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	204 ms	208 KiB

books

/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll skim (int i);
void answer (vector <int> v);
void impossible ();

void solve (int N, int K, ll A, int S) {
    int l = 1, r = N + 1;
    while (l < r) {
        int mid = (l + r) / 2;
        if (skim(mid) * K >= A) {
            r = mid;
        } else {
            l = mid + 1;
        }
    }
    vector <pair <int, ll>> v;
    for (int i = 1; i <= min(l - 1, K); i++) {
        v.push_back(make_pair(i, skim(i)));
    }
    for (int i = l; i <= min(N, l + K - 1); i++) {
        v.push_back(make_pair(i, skim(i)));
    }
    for (int mask = 0; mask < (1 << (int) v.size()); mask++) {
        ll sum = 0;
        vector <int> w;
        for (int i = 0; i < (int) v.size(); i++) {
            if ((mask >> i) & 1) {
                w.push_back(v[i].first);
                sum += v[i].second;
            }
        }
        if ((int) w.size() == K && A <= sum && sum <= A * 2) {
            answer(w);
            return;
        }
    }
    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