제출 #1195593

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

books

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

using namespace std;


int64_t cached[100005];

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

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