Submission #575042

#TimeUsernameProblemLanguageResultExecution timeMemory
575042RifalA Difficult(y) Choice (BOI21_books)C++14
0 / 100
12 ms976 KiB
#include <bits/stdc++.h>

#include "books.h"

using namespace std;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
//     books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ books_sample.cpp sample_grader.cpp
// in this folder.
//

void solve(int N, int K, long long A, int S) {

    vector<int> ans;
    long long arr[N+1] = {};
    for(int i = 1; i <= N; i++)
    {
        arr[i] = skim(i);
    }
    for(int i = 1; i <= N; i++)
    {
        arr[i] += arr[i-1];
    }
    for(int i = K; i <= N; i++)
    {
        long long sum = arr[i]-arr[i-K];
        if(sum >= A && sum <= A*2)
        {
            for(int j = (i-K)+1; j <= i; j++)
            {
                ans.push_back(j);
            }
            break;
        }
    }
    if(!ans.empty())
        answer(ans);
    else
        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...