Submission #400537

#	Time	Username	Problem	Language	Result	Execution time	Memory
400537		b00n0rp	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	3 ms	200 KiB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;

int a[100005];

// void solve(int N, int K, long long A, int S) {
//     for(int i = 1; i <= K; i ++) a[i] = skim(i);
//     int sm = 0;
// 	for(int i = 1; i <= K-1; i ++) sm += a[i];
// 	if(sm+a[K] > 2*A){
// 		impossible();
// 		return;
// 	}
//     int low = K,high = N,mid,ans;
// 	while(low <= high){
// 		mid = (low+high)/2;
// 		if(skim(mid)+sm <= 2*A){
// 			ans = mid;
// 			low = mid+1;
// 		}
// 		else high = mid-1;
// 	}
// 	for(int i = ans; i > ans-K; i --){
// 		sm += skim(i);
// 		if(sm >= A){
// 			vector<int> bruh;
// 			for(int j = i; j <= ans; j++) bruh.push_back(j);
// 			for(int j = 1; j <= K-(int)bruh.size(); j ++) bruh.push_back(j);
// 			answer(bruh);
// 		}
// 		sm -= a[K-(ans-i)-2];
// 	}
// }

void solve(int N, int K, long long A, int S) {
    for(int i = 1; i <= N; i ++) a[i] = skim(i);
    int sm = 0;
	for(int i = 1; i <= K-1; i ++) sm += a[i];
	if(sm+a[K] > 2*A){
		impossible();
		return;
	}
    int low = K,high = N,mid,ans;
	while(low <= high){
		mid = (low+high)/2;
		if(a[mid]+sm <= 2*A){
			ans = mid;
			low = mid+1;
		}
		else high = mid-1;
	}
	for(int i = ans; i > ans-K; i --){
		sm += a[i];
		if(sm >= A){
			vector<int> bruh;
			for(int j = i; j <= ans; j++) bruh.push_back(j);
			for(int j = 1; j <= K-(int)bruh.size(); j ++) bruh.push_back(j);
			// cout << "ans: " << sm << endl;
			assert(sm <= 2*A);
			answer(bruh);
			return;
		}
		sm -= a[K-(ans-i)-1];
	}
	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