제출 #401968

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

books

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

int n, k;
long long a;

vector<int> diff(100001);

vector<int> res;
long long curr_sum;

int L, R;

void res_search(int l, int books)
{
    // cerr << "rs " << l << ' ' << books << '\n';


    res.push_back(l);
    curr_sum += diff[l];

    if(books-1 == 0)
    {
        if(a <= curr_sum && curr_sum <= 2*a)
            answer(res);
            
        return;
    }

    for(int r = l+1; r <= R; r++)
        res_search(r, books-1);

}



void binary_search(int l, int r)
{
    // cerr << "bs " << l << ' ' << r << '\n';
    if(l == r)
    {
        L = max(1, l-k+1);
        R = min(n, r+k-1);
        for(int i = max(1, l-k+1); i <= min(n, r+k-1); i++)
            diff[i] = skim(i);

        res_search(L, k);
        impossible();
    }
    else
    {
        int m = (l+r)/2 + 1;
        if(k*skim(m) <= 2*a)
            return binary_search(m, r);
        else
            return binary_search(l, m-1);
    }
}


       //books, choice size, limit,  skim limit
void solve(int N, int K, long long A, int S)
{
    n = N;
    k = K;
    a = A;

    binary_search(1, N);
}

• 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