This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |