Submission #1301377

#	Time	Username	Problem	Language	Result	Execution time	Memory
1301377		efeg	A Difficult(y) Choice (BOI21_books)	C++20	0 / 100	4 ms	1200 KiB

books

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


using i64 = long long; 

template<typename T>
using vec = vector<T>;

void solve(int N, int K, long long A, int S) {
    vec<i64> x(N+1,0); 
    vec<int> ans(K,0); 
    i64 currSum = 0; 
    for (int i = 1; i <= N; i++) x[i] = skim(i); 
    
    for (int i = 0; i < K; i++){
        ans[i] = i+1; 
        currSum += x[i+1]; 
    } 
    if (currSum >= A && currSum <= 2 * A) answer(ans); 
    
    while (currSum < A){
        i64 mn = 1e18; int mnidx = -1; 
        for (int i = 0; i < K; i++){
            int idx = ans[i]; 

            if (i == K-1 || (idx + 1 != ans[i+1])){
                if (idx < N){
                    if (x[idx+1] - x[idx] < mn){
                        mn = x[idx+1] - x[idx]; 
                        mnidx = i; 
                    }
                }
            }
        }

        if (mnidx == -1) break; 

        currSum -= x[ans[mnidx]]; 
        ans[mnidx] = ans[mnidx] + 1; 
        currSum += x[ans[mnidx]];

        if (currSum >= A && currSum <= 2 * A){answer(ans);}
    }

    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