Submission #529609

#	Time	Username	Problem	Language	Result	Execution time	Memory
529609		mjhmjh1104	A Difficult(y) Choice (BOI21_books)	C++17	10 / 100	1 ms	200 KiB

books

#include <map>
#include "books.h"
using namespace std;

map<int, long long> m;

long long get(int x, int K) {
    long long ret = 0;
    for (int i = 0; i < K; i++) {
        if (m.find(x + i + 1) == m.end()) m[x + i + 1] = skim(x + i + 1);
        ret += m[x + i + 1];
    }
    return ret;
}

void solve(int N, int K, long long A, int S) {
    int l = 0, r = N - K;
    while (l < r) {
        int m = (l + r) / 2;
        long long t = get(m, 1);
        if (t < A / K) l = m + 1;
        else r = m;
    }
    while (l >= 0) {
        long long t = get(l, K);
        if (t >= A && t <= 2 * A) {
            vector<int> v;
            for (int i = 0; i < K; i++) v.push_back(l + i + 1);
            answer(v);
            return;
        } else if (t < A) {
            impossible();
            return;
        } else l--;
    }
    if (get(0, K) > 2 * A) {
        impossible();
        return;
    } else if (get(0, K) >= A) {
        vector<int> v;
        for (int i = 0; i < K; i++) v.push_back(i + 1);
        answer(v);
        return;
    }
    l = K + 1, r = N - 1;
    while (l <= r) {
        int m = (l + r) / 2;
        long long t = get(0, K - 1) + get(m, 1);
        if (t < A) l = m + 1;
        else if (t > 2 * A) r = m - 1;
        else {
            vector<int> v;
            for (int i = 0; i < K - 1; i++) v.push_back(i + 1);
            v.push_back(m + 1);
            answer(v);
            return;
        }
    }
    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