Submission #1369597

#TimeUsernameProblemLanguageResultExecution timeMemory
1369597aleksandreA Difficult(y) Choice (BOI21_books)C++20
0 / 100
2 ms440 KiB
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
long long val[100005];
long long query(int x) {
    if(val[x] == 0) val[x] = skim(x);
    return val[x];
}
void solve(int N, int K, long long A, int S) {
    vector<int> v;
    long long sum = 0;
    for(int i = 1; i < K; i++) {
        sum += query(i);
        v.push_back(i);
    }
    for(int j = K; j <= N; j++) {
        long long cur = sum + query(j);
        if(A <= cur && cur <= 2*A) {
            v.push_back(j);
            answer(v);
        }
    }
    impossible();
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...