제출 #811290

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
811290		alvingogo	A Difficult(y) Choice (BOI21_books)	C++14	0 / 100	1 ms	296 KiB

books

#include <bits/stdc++.h>
#define fs first
#define sc second
#include "books.h"

using namespace std;

void solve(int n, int k, long long a, int s) {
    vector<pair<int,int> > v;
    long long p=0;
    for(int i=1;i<k;i++){
        v.push_back({skim(i),i});
        p+=v.back().fs;
    }
    int l=k,r=n;
    while(r>l){
        int m=(l+r+1)/2;
        long long z=skim(m)+p;
        if(z>2*a){
            r=m-1;
        }
        else if(a<=z){
            vector<int> ans;
            for(int i=1;i<k;i++){
                ans.push_back(i);
            }
            ans.push_back(m);
            answer(ans);
            return;
        }
        else{
            l=m;
        }
    }
    vector<pair<int,int> > c;
    c.push_back({skim(l),l});
    for(int i=l-1;i>l-k;i--){
        c.push_back({skim(i),i});
    }
    reverse(c.begin(),c.end());
    for(int i=0;i<k;i++){
        long long z=0;
        for(int j=0;j<i;j++){
            z+=v[j].fs;
        }
        for(int j=i;j<k;j++){
            z+=c[j].sc;
        }
        if(2*a >= z && z>=a){
            vector<int> ans;
            for(int j=0;j<i;j++){
                ans.push_back(v[j].sc);
            }
            for(int j=i;j<k;j++){
                ans.push_back(c[j].sc);
            }
            answer(ans);
            return;
        }
    }
    impossible();
}

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