제출 #1000851

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

books

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ii pair<int,int>
const int nax=2e5+5;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

long long skim(int);

void answer(std::vector<int>);

void impossible();

void solve(int N, int K, long long A, int S){
    int l=0;
    int r=N-K+2;
    ll cur=0;
    vector<ll> vis(N+1,0);
    while(r-l>1){
        int mid=(r+l)/2;
        cur=0;
        for (int i = mid; i < mid+K ; ++i)
        {
            if(vis[i]!=0) cur+=vis[i];
            else {
                vis[i]=skim(i);
                cur+=vis[i];
            }
        }
        if(cur>=A) r=mid;
        else l=mid;
    }
    if(cur>2*A||cur<A) impossible();
    else{
        vector<int> ans;
        for (int i = r; i < r+K; ++i)
        {
            ans.pb(i);
        }
        answer(ans);
    }
    return;
}

• 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