제출 #1224431

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1224431		Jer	A Difficult(y) Choice (BOI21_books)	C++20	0 / 100	0 ms	408 KiB

books

#include <bits/stdc++.h>

#include "books.h"

typedef long long ll;

using namespace std;

const int MAXN = 1005;
int n, k, a;

#define get_min(b) b * k + (k * (k + 1)) / 2
#define get_max(b) b * k + a

void solve(int N, int K, long long A, int S) {
	n = N, k = K, a = A;

    int l = 1, h = n;
	ll curr;

	while (l < h){
		int m = (l + h) / 2;
		curr = skim(m);

		if (get_max(curr) < a)
			l = m + 1;
		else if (get_min(curr) > 2 * a)
			h = m - 1;
		else
		{
			vector<int> res;
			for (int i = curr; i < curr + k; i++) res.push_back(i);
			answer(res);
			return;
		}
	}

	impossible();
}

• 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