제출 #414977

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

books

#include <bits/stdc++.h>
#include "books.h"
using i64 = long long;
void solve(int n, int k, i64 A, int s) {
    std::vector<i64> a(n, -1);
    auto ask = [&](int i) -> i64 {
        if (~a[i]) {
            return a[i];
        } else {
            return a[i] = skim(i + 1);
        }
    };
    int l = -1, r = n;
    while (l + 1 < r) {
        int mid = (l + r) / 2;
        if (ask(mid) * k > A && ask(mid) * k <= 2 * A) {
            l = mid;
            break;
        } else if (ask(mid) * k <= A) {
            l = mid;
        } else {
            r = mid;
        }
    }
    int t = std::max(0, l - k);
    std::vector<int> ans;
    i64 sum = 0;
    for (int i = 0; i < k - 1; i++) {
        sum += ask(i + t);
        ans.push_back(i + t + 1);
    }
    // std::cout << sum << "\n";
    l = t + k - 2, r = n;
    while (l + 1 < r) {
        int mid = (l + r) / 2;
        if (sum + ask(mid) >= A && sum + ask(mid) <= 2 * A) {
            ans.push_back(mid);
            answer(ans);
        } else if (sum + ask(mid) < A) {
            l = mid;
        } else {
            r = mid;
        }
    }
    impossible();
}

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