Submission #406105

#	Time	Username	Problem	Language	Result	Execution time	Memory
406105		tqbfjotld	A Difficult(y) Choice (BOI21_books)	C++14	0 / 100	1 ms	584 KiB

books

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

using namespace std;
int cache[100005];
int n;
int query(int a){
    assert(a>=1 && a<=n);
    if (cache[a]!=-1) return cache[a];
    return cache[a] = skim(a);
}

int find_val(int a, int b, int c = 1, int d = n){
    if (query(c)>b) return -(c-1);
    if (query(c)>=a) return c;
    if (query(d)<a) return -d;
    if (query(d)<=b) return d;
    while (c+1<d){
        int mid = (c+d)/2;
        int t = query(mid);
        if (a<=t && t<=b) return mid;
        if (t<a) c = mid;
        else d = mid;
    }
    return -c;
}

void solve(int N, int K, long long A, int S) {
    memset(cache,-1,sizeof(cache));
    n = N;

    int en = N;
    vector<int> extr;
    for (int x = K-1; x>=0; x--){
        vector<int> ans;
        for (int y = 0; y<x; y++){
            ans.push_back(y+1);
        }
        for (auto y : extr) ans.push_back(y);
        int sum = 0;
        for (auto x : ans){
            sum += query(x);
        }
        int res = find_val(A-sum,2*A-sum,x+1,en);
        if (res>0){
            ans.push_back(res);
            answer(ans);
            return;
        }
        en = -res-1;
        if (x>en){
            impossible();
            return;
        }
        extr.push_back(-res);
    }
    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