제출 #991874

#제출 시각아이디문제언어결과실행 시간메모리
99187412345678A Difficult(y) Choice (BOI21_books)C++17
0 / 100
7 ms604 KiB
#include <bits/stdc++.h>
#include "books.h"

using namespace std;

const int nx=1e5+5;

long long n, k, a[nx], t;

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