제출 #1269793

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1269793		AlgorithmWarrior	A Difficult(y) Choice (BOI21_books)	C++20	100 / 100	1 ms	408 KiB

books

#include <bits/stdc++.h>
#include"books.h"

using namespace std;

long long v[15];

void solve(int N, int K, long long A, int S) {
    long long sum=0;
    int i;
    for(i=1;i<=K;++i)
        sum+=(v[i]=skim(i));
    if(sum>2*A)
        impossible();
    if(A<=sum){
        vector<int>v;
        for(i=1;i<=K;++i)
            v.push_back(i);
        answer(v);
    }
    sum-=v[K];
    /// [)
    int st=K,dr=N+1;
    while(dr-st>1){
        int mij=(st+dr)/2;
        if(skim(mij)+sum<=2*A)
            st=mij;
        else
            dr=mij;
    }
    sum+=v[K];
    for(i=1;i<=K;++i){
        sum-=v[K-i+1];
        sum+=skim(st-i+1);
        if(A<=sum){
            vector<int>v;
            int j;
            for(j=1;j<=K-i;++j)
                v.push_back(j);
            for(j=st-i+1;j<=st;++j)
                v.push_back(j);
            answer(v);
        }
    }
    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