Submission #667402

#	Time	Username	Problem	Language	Result	Execution time	Memory
667402		someone	A Difficult(y) Choice (BOI21_books)	C++14	0 / 100	1 ms	296 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) {
    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) {
    vector<int> ans;
    ll sum = 0;
    for(int i = 1; i <= K; i++)
        sum += get(i);
    int last = K;
    for(int i = K; i <= N; i++) {
        last = i;
        if(i == N || sum + val[i+1] - val[K] > 2*A)
            i = N+1;
    }
    for(int i = K; i > 0; i--) {
        if(sum + get(last + i - K) - get(i) <= 2*A) {
            sum += get(last + i - K) - get(i);
            ans.push_back(last + i - K);
        }
        if(sum >= A) {
            for(int j = 1; j < i; j++)
                ans.push_back(j);
            answer(ans);
            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