Submission #846910

#	Time	Username	Problem	Language	Result	Execution time	Memory
846910		MinaRagy06	A Difficult(y) Choice (BOI21_books)	C++17	20 / 100	129 ms	2904 KiB

books

#include <bits/stdc++.h>
#ifdef MINA
    #include "grader.cpp"
#else
    #ifdef DEBUG
        #include "grader2.cpp"
    #endif
#endif
#include "books.h"
#define ll long long
using namespace std;

ll b[100'005];
ll ask(int i) {
    if (~b[i]) return b[i];
    return b[i] = skim(i + 1);
}
void solve(int n, int k, ll a, int Q) {
    memset(b, -1, sizeof b);
    __int128_t prfx[n + 1]{};
    for (int i = 0; i < n; i++) {
        b[i] = ask(i);
        prfx[i + 1] = prfx[i] + b[i];
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= min(k, i); j++) {
            __int128_t s = prfx[i] - prfx[i - j];
            int rem = k - j;
            if (rem == 0) {
                if (a <= s && s <= 2 * a) {
                    vector<int> ans;
                    for (int k = i - j + 1; k <= i; k++) {
                        ans.push_back(k);
                    }
                    answer(ans);
                    return;
                } else {
                    continue;
                }
            }
            int l = i + rem, r = n - 1;
            if (l > r) continue;
            while (l <= r) {
                int md = (l + r) >> 1;
                if (prfx[md] - prfx[md - rem] + s < a) {
                    l = md + 1;
                } else if (prfx[md] - prfx[md - rem] + s > 2 * a) {
                    r = md - 1;
                } else {
                    vector<int> ans;
                    for (int k = i - j + 1; k <= i; k++) {
                        ans.push_back(k);
                    }
                    for (int k = md - rem + 1; k <= md; k++) {
                        ans.push_back(k);
                    }
                    answer(ans);
                    return;
                }
            }
        }
    }
    impossible();
}

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