Submission #1269732

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269732		AlgorithmWarrior	A Difficult(y) Choice (BOI21_books)	C++20	0 / 100	3 ms	420 KiB

books

#include <bits/stdc++.h>
#include"books.h"

using namespace std;

int const NMAX=100005;
long long v[NMAX];

void solve(int N, int K, long long A, int S) {
    int i;
    for(i=1;i<=N;++i)
        v[i]=skim(i);
    long long sum=0;
    for(i=1;i<K;++i)
        sum+=v[i];
    for(i=K;i<=N;++i){
        sum+=v[i];
        sum-=v[i-K];
        if(A<=sum && sum<=2*A){
            vector<int>v;
            int j;
            for(j=i-K+1;j<=i;++j)
                v.push_back(j);
            answer(v);
        }
    }
    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