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;
#define all(a) begin(a),end(a)
using ll = long long;
using vi = vector<int>;
const int N = (int)1e5+10;
ll sum, a[N];
void solve(int n, int K, ll A, int S) {
vi ans(K,0); iota(all(ans),1);
for(int i = 1; i <= K; i++)
a[i]=skim(i), sum+=a[i];
if(sum>2*A) impossible();
int l = K, r = n;
while(l<r){
int mid = (l+r+1)/2;
if(sum-a[K]+skim(mid)<=2*A) l=mid;
else r=mid-1;
}
deque<int> ans2(K,0); iota(all(ans2),1);
for(int i = 1; i <= K+1; i++){
if(sum>=A) answer(vi(all(ans2)));
if(l-i<=K) break;
sum-=a[i]; ans2.pop_front();
sum+=skim(l-i); ans2.push_back(l-i);
}
impossible();
}
# | 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... |