제출 #847270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
847270		Ahmed57	A Difficult(y) Choice (BOI21_books)	C++17	25 / 100	4 ms	2320 KiB

books

#include <bits/stdc++.h>
using namespace std;
#include "books.h"

long long val[100001];
int xd= 0;
int s;
long long qu(int i){
    if(val[i]!=-1)return val[i];
    xd++;
    if(xd>s)assert(0);
    return val[i] = skim(i);
}
void solve(int N,int K,long long A,int S){
    memset(val,-1,sizeof val);
    s = S;

    long long l = 1 , r = N-K+1 , ans = N-K+2 , sum = 0;
    while(l<=r){
        int mid = (l+r)/2;
        long long val = 0;
        for(int i = mid;i<mid+K;i++){
            val+=qu(i);
        }
        if(val>=A){
            r = mid-1;
            sum = val;
            ans = mid;
        }else l = mid+1;
    }
    if(ans==N-K+2){
        for(int i = N-K+2;i<=N;i++)sum+=qu(i);
    }else sum-=qu(ans+K-1);
    for(int j = 1;j<K;j++){
    sum = 0;
    for(int i = ans;i<ans+K-j;i++)sum+=qu(i);
    vector<int> xd;
    for(int i = 1;i<=N;i++)if(i<ans||i>=ans+K-j)xd.push_back(i);
    l = 0 , r = xd.size()-j;
    while(l<=r){
        int mid = (l+r)/2;
        long long su = 0;
        for(int i = mid;i<mid+j;i++){
            su+=qu(xd[i]);
        }
        if(sum+su<A){
            l= mid+1;
        }else if(sum+su>2*A){
            r = mid-1;
        }else{
            vector<int> v;
            for(int i = ans;i<ans+K-j;i++)v.push_back(i);
            for(int i = mid;i<mid+j;i++)v.push_back(xd[i]);
            answer(v);
            return ;
        }
    }
    if(ans==1)continue;
    ans--;sum = 0;
    for(int i = ans;i<ans+K-j;i++)sum+=qu(i);
    l = 0 , r = xd.size()-j;
    while(l<=r){
        int mid = (l+r)/2;
        long long su = 0;
        for(int i = mid;i<mid+j;i++){
            su+=qu(xd[i]);
        }
        if(sum+su<A){
            l= mid+1;
        }else if(sum+su>2*A){
            r = mid-1;
        }else{
            vector<int> v;
            for(int i = ans;i<ans+K-j;i++)v.push_back(i);
            for(int i = mid;i<mid+j;i++)v.push_back(xd[i]);
            answer(v);
            return ;
        }
    }
    ans++;sum = 0;
    for(int i = ans;i<ans+K-j;i++)sum+=qu(i);
    }
    impossible();
}

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