Submission #863605

#	Time	Username	Problem	Language	Result	Execution time	Memory
863605		TAhmed33	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	5 ms	596 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) {
	assert(s >= n);
	ll arr[n + 1] = {};
	for (int i = 1; i <= n; i++) arr[i] = skim(i);
	for (int i = 1; i + k - 1 <= n; i++) {
		ll sum = 0;
		vector <int> t;
		for (int j = i; j <= i + k - 1; j++) {
			sum += arr[j];
			t.push_back(j);
		}
		if (sum >= a && sum <= 2 * a) {
			answer(t);
			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