Submission #528412

#TimeUsernameProblemLanguageResultExecution timeMemory
52841279brueA Difficult(y) Choice (BOI21_books)C++14
0 / 100
15 ms308 KiB
#include "books.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, k;
ll arr[100002];
int s, lim;

void solve(int N, int K, ll A, int S){
    n = N, k = K, s = S, lim = A;

    for(int i=1; i<=n; i++) arr[i] = skim(i);

    for(int i=1; i<=n-k; i++){
        ll sum = 0;
        for(int j=i; j<=i+k; j++) sum += arr[j];
        for(int j=i; j<=i+k; j++){
            if(A <= sum - arr[j] && sum - arr[j] <= A+A){
                vector<int> v;
                for(int a=i; a<=i+k; a++) if(a!=j) v.push_back(a);
                answer(v);
                return;
            }
        }
    }
    impossible();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...