Submission #1138026

#	Time	Username	Problem	Language	Result	Execution time	Memory
1138026		ConquerConquerer	A Difficult(y) Choice (BOI21_books)	C++20	10 / 100	0 ms	424 KiB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;

long long value[100005];

void solve(int N, int K, long long A, int S) {
    int low = 1, high = N - K + 1;
    while (low <= high) {
        int mid = (low + high) >> 1;

        long long total = 0;
        for (int i = mid; i < mid + K; i++) {
            if (!value[i]) value[i] = skim(i);
            total += value[i];
        }

        if (A <= total && total <= A + A) {
            vector<int> v;
            for (int i = mid; i < mid + K; i++)
                v.push_back(i);
            answer(v);
            return ;
        }

        if (total < A) low = mid + 1;
            else high = mid - 1;
    }
    impossible();
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 10 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20