제출 #1066996

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

books

//Dost SEFEROĞLU
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<    
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>

using namespace std;

void solve(int32_t N, int32_t K, long long A, int32_t S) {
    vi memory(N+1,0);
    auto get = [&](int p) -> int {
        if (memory[p]) return memory[p];
        return memory[p] = skim(p);
    };
    int sm = 0;
    for (int i=1;i<=K-1;i++) sm+=get(i);
    int l = K;
    int r = N;
    while (l<=r) {
        int m = (l+r) >> 1;
        if (get(m)+sm >= A) r = m-1;
        else l = m+1;
    }
    if (get(l)+sm <= 2*A) {
        vector<int32_t> v;
        for (int j=1;j<=K-1;j++) v.push_back(j);
        v.push_back(l);
        answer(v);
        return;
    }
    if (l == K) impossible();
    vi pref(K,0);
    for (int i=1;i<=K-1;i++) pref[i] = pref[i-1]+get(i);
    sm = 0;
    for (int i=l-1;i>=l-K;i--) {
        sm+=get(i);
        if (sm+pref[K-(l-i)] >= A && sm+pref[K-(l-i)] <= 2*A) {
            vector<int32_t> v;
            for (int j=1;j<=K-(l-i);j++) v.push_back(j);
            for (int j=i;j<=l-1;j++) v.push_back(j);
            answer(v);
            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