Submission #1334315

#	Time	Username	Problem	Language	Result	Execution time	Memory
1334315		yc11	A Difficult(y) Choice (BOI21_books)	C++20	0 / 100	1 ms	800 KiB

books

#include "books.h"
#include <vector>
using namespace std;
void solve(int N, int K, long long A, int S) {
    long long a = 1;
    long long b = N;
    vector<int> n1;
    vector<int> pre;
    n1.resize(N);
    while (a<b){
        long long x = (a+b)/2;
        n1[x-1] = skim(x);
        if (n1[x-1]>=A) b = x;
        else a = x+1;
    }

    int ans = n1[b];
    for (int i = 0;i<K-1;i++){
        n1[i] = skim(i+1);
        ans = ans+n1[i];
    }
    if (ans<2*A and ans>A){
        vector<int> a1;
        a1.push_back(b);
        for (int i = 0;i<K-1;i++) a1.push_back(i+1);
        answer(a1);
        return;
    }

    int b1 = b;
    ans = ans-n1[b-1];


    n1[K-1] = skim(K);
    ans = ans+n1[K-1];
    int c = 0;
    b--;

    while (ans<A){
        ans = ans-n1[c]+skim(b+1);

        c++;
        b--;
    }
    if (ans>=A){
        vector<int> a1;
        for (int i = c;i<K;i++) a1.push_back(i+1);
        for (int i = b+1;i<b1;i++) a1.push_back(i+1);
        answer(a1);
        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