Submission #991957

#	Time	Username	Problem	Language	Result	Execution time	Memory
991957		12345678	A Difficult(y) Choice (BOI21_books)	C++17	20 / 100	188 ms	2400 KiB

books

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

using namespace std;

const int nx=1e5+5;

long long n, k, a[nx], t;
set<pair<long long, long long>> s;

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=1; i<=n; i++)
    {
        if (i>=k)
        {
            auto itr=s.lower_bound(make_pair(t-a[i], LLONG_MIN));
            if (itr!=s.end()&&itr->first+a[i]<=2*t)
            {
                vector<int> res;
                for (int j=0; j<k-1; j++) res.push_back(itr->second-j);
                res.push_back(i);
                answer(res);
            }
        }
        if (i>=k-1)
        {
            long long sm=0;
            for (int j=0; j<k-1; j++) sm+=a[i-j];
            s.insert({sm, i});
        }
    }
    impossible();
}

/*
5 3 10 5
1 2 9 10 100
*/

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20