제출 #400588

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
400588		b00n0rp	A Difficult(y) Choice (BOI21_books)	C++17	100 / 100	27 ms	204 KiB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;

long long a[100005];

void solve(int N, int K, long long A, int S) {
    for(int i = 1; i <= K; i ++) a[i] = skim(i);
    long long sm = 0;
	for(int i = 1; i <= K; i ++){
		sm += a[i];
		if(sm > 2*A){
			impossible();
			return;
		}
	}
    int low = K,high = N,mid,ans;
	while(low <= high){
		mid = (low+high)/2;
		if(skim(mid)+sm-a[K] <= 2*A){
			ans = mid;
			low = mid+1;
		}
		else high = mid-1;
	}
	int cur = K;
	for(int i = ans; i > ans-K; i --){
		sm -= a[cur];
		sm += skim(i);
		cur--;
		if(sm >= A){
			vector<int> bruh;
			for(int j = i; j <= ans; j++) bruh.push_back(j);
			for(int j = 1; j <= cur; j ++) bruh.push_back(j);
			answer(bruh);
			return;
		}
	}
	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