제출 #863576

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

books

#include <bits/stdc++.h>
#include <books.h>
using namespace std;
typedef long long ll;
void solve (int n, int k, ll a, int s) {
	map <int, ll> dd;
	int l = 1, r = n - k + 1;
	int ans = -1;
	while (l <= r) {
		int mid = (l + r) >> 1;
		long long sum = 0;
		for (int i = mid; i <= mid + k - 1; i++) {
			if (!dd.count(i)) dd[i] = skim(i);
			sum += dd[i];
		}
		if (sum >= a) {
			r = mid - 1; ans = mid;
		} else {
			l = mid + 1;
		}
	}
	if (ans == -1) impossible();
	long long t = 0;
	for (int i = ans; i <= ans + k - 1; i++) t += dd[i];
	if (t > 2 * a) impossible();	
	vector <int> ret;
	for (int i = ans; i <= ans + k - 1; i++) ret.push_back(i);
	answer(ret);
}

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