제출 #506346

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

books

#include <cmath>

#include <algorithm>
#include <bitset>
#include <numeric>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>

#include "books.h"

using namespace std;

long long arr[25];

void solve(int N, int K, long long A, int S) {
	int low = 1, high = N + 1;
	long long C = (A + K - 1) / K, temp;
	while (low < high) {
		int mid = (low + high) / 2;
		if ((temp = skim(mid)) >= C) {
			high = mid;
			arr[K] = temp;
		}
		else low = mid + 1;
	}
	if (low > N) return impossible();
	for (int i = 1; i < K; ++i)
		arr[K - i] = i < low ? skim(low - i) : (A * 2 + 1);
	for (int i = 1; i < K; ++i)
		arr[K + i] = i + low <= N ? skim(i + low) : (A * 2 + 1);
	for (int i = 1; i <= K; ++i) {
		long long sum = accumulate(arr + i, arr + i + K, 0LL);
		if (sum >= A && sum <= A * 2) {
			vector<int> ans(K);
			iota(ans.begin(), ans.end(), low - K + i);
			return answer(ans);
		}
	}
	int pos = K;
	while (arr[pos] <= A) ++pos;
	long long sum = 0;
	for (int i = 1; i != K; ++i) sum += arr[i];
	if (arr[pos] + sum <= A * 2) {
		vector<int> ans(K);
		iota(ans.begin(), ans.end(), low - K + 1);
		ans[K - 1] = low + pos - K;
		return answer(ans);
	}
	return impossible();
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 10 / 10
• Subtask 4: 15 / 15
• Subtask 5: 0 / 15
• Subtask 6: 20 / 20
• Subtask 7: 0 / 20