Submission #1224639

#	Time	Username	Problem	Language	Result	Execution time	Memory
1224639		Jer	A Difficult(y) Choice (BOI21_books)	C++20	0 / 100	1 ms	420 KiB

books

#include <bits/stdc++.h>

#include "books.h"

typedef long long ll;

using namespace std;

const int MAXN = 10e5 + 5;
int n, k;
ll a;
ll books[MAXN];

void ans(int i){
	vector<int> res;
	for (int j = i; j < i + k; j++) res.push_back(j);
	answer(res);
}

void solve(int N, int K, long long A, int S) {
	n = N, k = K, a = A;
	for (int i = 1; i <= n; i++)
		books[i] = skim(i);
	
	ll sum = 0;
	for (int i = 1; i <= k; i++) sum += books[i];

	if (sum >= a and sum <= 2 * a) return ans(1);

	for (int i = k + 1; i <= n; i++)
	{
		sum += books[i] - books[i - k];
		if (sum >= a and sum <= 2 * a) return ans(i - k);
	}

	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