Submission #531923

#	Time	Username	Problem	Language	Result	Execution time	Memory
531923		4fecta	A Difficult(y) Choice (BOI21_books)	C++17	60 / 100	2 ms	1864 KiB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

int h[100005], in[100005];

void solve(int32_t n, int32_t k, int a, int32_t s) {
    memset(h, 0, sizeof(h));
    memset(in, 0, sizeof(in));
    vector<int32_t> ret;
    int sum = 0;
    for (int i = 1; i < k; i++) {
        h[i] = skim(i);
        sum += h[i];
        in[i] = 1;
    }
    int lo = k, hi = n, mid;
    while (lo < hi) {
        mid = (lo + hi + 1) >> 1;
        h[mid] = skim(mid);
        if (sum + h[mid] > 2 * a) hi = mid - 1;
        else lo = mid;
    }
    in[lo] = 1;
    sum += h[lo];
    if (sum > 2 * a) impossible();
    if (sum >= a) {
        for (int i = 0; i < 100005; i++) if (in[i]) ret.push_back(i);
        answer(ret);
    }
    for (int i = 1; i < k; i++) {
        h[lo - i] = skim(lo - i);
        sum += h[lo - i] - h[k - i];
        in[lo - i] = 1, in[k - i] = 0;
        if (sum >= a) {
            for (int j = 0; j < 100005; j++) if (in[j]) ret.push_back(j);
            answer(ret);
        }
    }
    impossible();
}

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