제출 #1195583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1195583		anmattroi	A Difficult(y) Choice (BOI21_books)	C++17	10 / 100	0 ms	412 KiB

books

#include "books.h"
#include <bits/stdc++.h>

using namespace std;


map<int, long long> cached;

long long get(int x) {
    return cached.count(x) ? cached[x] : cached[x] = skim(x);
}

void solve(int N, int K, long long A, int S) {
    int lo = K-1, hi = N;
    while (hi - lo > 1) {
        int mid = (lo + hi) >> 1;
        int64_t SUM = 0;
        for (int i = mid-K+1; i <= mid; i++) SUM += get(i);
        if (SUM >= A) hi = mid;
        else lo = mid;
    }
    int64_t SUM = 0;
    for (int i = hi-K+1; i <= hi; i++) SUM += get(i);
    if (A <= SUM && SUM <= 2 * A) {
        vector<int> ans;
        for (int i = hi-K+1; i <= hi; i++) ans.emplace_back(i);
        answer(ans);
        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