제출 #1011305

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

books

#include <bits/stdc++.h>

#include "books.h"

using namespace std;
using ll = long long;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
//     books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ books_sample.cpp sample_grader.cpp
// in this folder.
//


// vector <int> NUMS;
// ll skim(int x) {
//     return NUMS[x];
// }

void solve(int N, int K, ll A, int S) {
    int lo = 1, hi = N;
    int r = -1;
    while (lo <= hi) {
        int mid = (lo + hi) / 2;
        int x = skim(mid);
        if (x >= A) {
            hi = mid-1;
        } else {
            lo = mid+1;
            r = mid;
        }
    }
    if (r == -1)
        impossible();
    else {
        vector <int> ans(K);
        for (int i = r - K + 1; i <= r; i++)
            ans[i - (r - K + 1)] = i;
        answer(ans);
    }
}
// int main() {
//     int n, k, a, s;
//     cin >> n >> k >> a >> s;
//     NUMS.resize(n+1);
//     for (int i = 1; i <= n; i++)
//         cin >> NUMS[i];
//     solve(n, k, a, s);
// }

• 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