제출 #863718

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

books

#include <bits/stdc++.h>
#include <books.h>
using namespace std;
typedef long long ll;
//3amlen eh ya gd3an, ana fadely sa3ten lesa
int arr[100001];
void solve (int n, int k, ll a, int s) {
	for (int i = 1; i <= n; i++) {
		arr[i] = skim(i);
	}
	ll sum2 = 0;
	int pos = -1;
	for (int i = k; i <= n; i++) {
		if (arr[i] > a) {
			pos = i;
			break;
		}
	}
	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);
		}
	}
	sum2 += arr[pos];
	for (int i = 1; i < k; i++) sum2 += arr[i];
	if (sum2 >= a && sum2 <= 2 * a) {
		vector <int> t;
		for (int i = 1; i < k; i++) t.push_back(i);
		t.push_back(pos);
		answer(t);
	}
	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