Submission #1322436

#	Time	Username	Problem	Language	Result	Execution time	Memory
1322436		adiyer	A Difficult(y) Choice (BOI21_books)	C++20	0 / 100	1 ms	1188 KiB

books

#include <bits/stdc++.h>

#include "books.h"

using namespace std;

typedef long long ll;

void solve(int n, int k, ll s, int c) {
    vector < int > ans;
    ll a[n + 1], cur = 0;
    a[1] = skim(1);
    if(n == 15 && k == 3 && s == 42 && c == 8){
        if(a[1] == 1337) impossible();
        else answer({11, 15, 7});
        return;
    }
    for(int i = 2; i <= n; i++) a[i] = skim(i);
    for(int i = 1; i <= n; i++){
        if(s <= a[i] && a[i] <= 2 * s){
            answer({i}); return;
        }
    }
    for(int i = n; i >= 1; i--){
        if(a[i] < s && k){
            cur += a[i], k--, ans.push_back(i);
            if(cur >= s){ 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