제출 #401156

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

books

#include <iostream>
#include <vector>
using namespace std;
#include "books.h"

int findA(vector<long long>& books, long long A, int lower, int upper) {
	if (books[lower] == -1) {
		books[lower] = skim(lower + 1);
	}
	if (books[upper] == -1) {
		books[upper] = skim(upper + 1);
	}
	if (books[lower] > A) {
		return -1;
	}
	if (books[upper] <= A) {
		return upper;
	}

	if (upper - lower < 2) {
		return lower;
	}

	int half = (upper - lower + 1) / 2;
	books[lower + half] = skim(lower + half + 1);

	if (books[lower + half] < A) return findA(books, A, lower + half, upper);
	else return findA(books, A, lower, lower + half);
}

void solve(int N, int K, long long A, int S) {
	if (K > N) {
		impossible();
		return;
	}
	vector<long long> books(N);

	for (int i = 0; i < N; i++) {
		books[i] = -1;
	}
	int posA = findA(books, A, 0, N - 1);
	if (posA == -1) {
		impossible();
	}
	else {
		if (posA == (N - 1)) {
			long long sum = 0;
			vector<int> res;
			for (int i = 0; i < K; i++) {
				res.push_back(N - i);
				if (books[N - i - 1] == -1) {
					books[N - i - 1] = skim(N - i);
				}
				sum += books[N - i - 1];
			}
			if (sum < A) {
				impossible();
			}
			answer(res);
		}
		else {
			vector<int> res;
			int lastPos = posA + 1 + K;
			if (lastPos > N) {
				lastPos = N;
			}
			
			for (int i = 0; i < K; i++) {
				res.push_back(lastPos - i);
			}
			answer(res);
		}
	}
	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