Submission #555835

#	Time	Username	Problem	Language	Result	Execution time	Memory
555835		someone	A Difficult(y) Choice (BOI21_books)	C++14	0 / 100	2 ms	284 KiB

books

#include "books.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int MAXN = 2e5 + 42;

ll val[MAXN];

ll get(int i) {
    if(val[i] == 0)
        val[i] = skim(i);
    return val[i];
}

int dicho(int deb, int fin, int maxi) {

    for(int i = fin-1; i > deb; i--)
        if(get(i) <= maxi)
            return i;
    return deb;
    /*
    if(deb + 1 == fin)
        return deb;
    int med = (deb + fin) >> 1;
    if(get(med) <= maxi)
        return dicho(med, fin, maxi);
    return dicho(deb, med, maxi);
*/
}

void solve(int N, int K, ll A, int S) {
    ll sum = 0;
    for(int i = 1; i <= K; i++)
        sum += get(i);
    if(sum > 2 * A) {
        impossible();
        return;
    }
    if(sum >= A) {
        vector<int> v;
        for(int i = 1; i <= K; i++)
            v.push_back(i);
        answer(v);
        return;
    }
    int id = dicho(K, N+1, 2*A - sum + get(K));
    //cout << id << ' '<< get(id) << ' ' << 2*A - sum + get(K) << '\n';
    for(int i = K; i > 0; i--) {
        sum += get(id + i - K) - get(i);
        //cout << "1 ... " << (i-1) << ' ' << id + i - K << " .. " << id << "   " << sum << '\n';
        if(A <= sum) {
            vector<int> v;
            for(int j = 1; j < i; j++)
                v.push_back(j);
            for(int j = id + i - K; j <= id; j++)
                v.push_back(j);
            answer(v);
            return;
        }
    }
    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