Submission #402096

#	Time	Username	Problem	Language	Result	Execution time	Memory
402096		rrrr10000	A Difficult(y) Choice (BOI21_books)	C++14	100 / 100	3 ms	1096 KiB

books

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=998244353;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
#include "books.h"
void solve(int n, int K, long long A, int S){
    vb use(n,false);
    ll sum=0;
    vi memo(n,-1);
    auto ask=[&](ll i){
        if(memo[i]!=-1)return memo[i];
        memo[i]=skim(i+1);
        return memo[i];
    };
    rep(i,K){
        use[i]=true;
        sum+=ask(i);
    }
    if(sum>A*2){
        impossible();return;
    }
    if(sum>=A){
        vector<int> res;
        rep(i,K)res.pb(i+1);
        answer(res);return;
    }
    ll lst=ask(n-1),cur;
    if(sum+lst-ask(K-1)>2*A){
        ll ok=K-1,ng=n-1;
        while(ng-ok>1){
            ll md=(ok+ng)/2;
            if(sum+ask(md)-ask(K-1)>2*A)ng=md;
            else ok=md;
        }
        sum=sum+ask(ok)-ask(K-1);use[K-1]=false;use[ok]=true;
        cur=ok-1;
    }
    else{
        sum=sum+ask(n-1)-ask(K-1);use[K-1]=false;use[n-1]=true;
        cur=n-2;
    }
    if(sum>=A){
        vector<int> res;
        rep(i,n)if(use[i])res.pb(i+1);
        answer(res);return;
    }
    for(int i=K-2;i>=0;i--){
        sum=sum+ask(cur)-ask(i);use[i]=false;use[cur]=true;
        cur--;
        if(sum>=A)break;
    }
    if(sum>=A){
        vector<int> res;
        rep(i,n)if(use[i])res.pb(i+1);
        answer(res);return;
    }
    impossible();
}

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