| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1100563 | epicci23 | A Difficult(y) Choice (BOI21_books) | C++17 | 0 ms | 0 KiB |
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"
//#define int long long
using namespace std;
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
map<int,long long> Cache;
long long ask(int ind){
if(Cache.count(ind)) return Cache[ind];
return Cache[ind]=skim(ind);
}
void solve(int n, int k, long long A, int s) {
vector<long long> ilk;
for(int i=1;i<=k;i++) ilk.push_back(ask(i));
long long summ=accumulate(all(ilk),0LL);
if(summ>2*A){
impossible();
return;
}
if(summ>=A){
vector<int> lol;
for(int i=1;i<=k;i++) lol.push_back(i);
answer(lol);
return;
}
int l=k,r=n;
while(l<r){
int mid=(l+r+1)/2;
if(ask(mid)<A) l=mid;
else r=mid-1;
}
long long kaydet1=ask(l);
long long kaydet2=-1;
if(l+1<=n) kaydet2=ask(l+1);
if(kaydet2!=-1){
vector<int> lol;
for(int i=1;i<k;i++) lol.push_back(i);
lol.push_back(l+1);
answer(lol);
return;
}
for(int i=l;i>k;i--){
summ-=ilk.back();
ilk.pop_back();
summ+=ask(i);
if(summ>=A && sum<=2*A){
vector<int> lol;
for(int j=1;j<=sz(ilk);j++) lol.push_back(j);
for(int j=i;j<=l;j++) lol.push_back(j);
answer(lol);
return;
}
if(ilk.empty()){
impossible();
return;
}
}
impossible();
return;
}
/*
void _(){
}
int32_t main(){
cin.tie(0);
ios::sync_with_stdio(0);
int tc=1;//cin >> tc;
while(tc--) _();
}*/