Submission #575520

#	Time	Username	Problem	Language	Result	Execution time	Memory
575520		birthdaycake	A Difficult(y) Choice (BOI21_books)	C++17	30 / 100	225 ms	764 KiB

books

#include <bits/stdc++.h>
#include "books.h"
 
using namespace std;
 
long long b[200001], vs[200001];
 
void solve(int n, int k, long long a, int s) {
    if(s == n){
        long long tot = 0;
    vector<int>fin;
    for(int i = 1; i <= n; i++) {
        b[i] = skim(i);
        if(i < k)  {
            tot += b[i];
            fin.push_back(i);
        }
        vs[i] = 0;
    }
    for(int i = k; i <= n; i++){
        if(b[i] > a){
            tot += b[i];
            fin.push_back(i);
            if(tot >= a && tot <= 2 * a){
                answer(fin);
            }
            break;
        }
    }
    for(int i = 1; i + k - 1 <= n; i++){
        tot = 0;
        vector<int>fin;
        for(int j = i; j <= i + k - 1; j++){
            tot += b[j];
            fin.push_back(j);
        }
        if(tot >= a && tot <= 2 * a){
            answer(fin);
        }
    }
    impossible();
    }else{
        int l = 1, r = n - k + 1;
        while(l <= r){
            long long mid = (l + r) / 2, tot = 0;
            vector<int>fin;
            for(int i = mid; i <= mid + k - 1 ;i++){
                if(b[i] == 0) b[i] = skim(i);
                tot += b[i];
                fin.push_back(i);
            }
            if(tot >= a && tot <= 2 * a){
                answer(fin);
            }
            if(tot > 2 * a){
                r = mid - 1;
            }else{
                l = mid + 1;
            }
        }
        
        impossible();
    }
    
}

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 10 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20