Submission #1115501

#TimeUsernameProblemLanguageResultExecution timeMemory
1115501Dan4LifeA Difficult(y) Choice (BOI21_books)C++17
0 / 100
2 ms336 KiB
#include <bits/stdc++.h>
#include "books.h"
using namespace std;
#define all(a) begin(a),end(a)
using ll = long long;
using vi = vector<int>;
const int N = (int)1e5+10;
ll sum, a[N];

void solve(int n, int K, ll A, int S) {
	vi ans(K,0); iota(all(ans),1);
	for(int i = 1; i <= K; i++) 
		a[i]=skim(i), sum+=a[i];
	if(sum>2*A) impossible();
	int l = K, r = n;
	while(l<r){
		int mid = (l+r+1)/2;
		if(sum-a[K]+skim(mid)<=2*A) l=mid;
		else r=mid-1;
	}
	deque<int> ans2(K,0); iota(all(ans2),1);
	for(int i = 1; i <= K+1; i++){
		if(sum>=A) answer(vi(all(ans2)));
		if(l-i<=K) break;
		sum-=a[i]; ans2.pop_front();
		sum+=skim(l-i); ans2.push_back(l-i);
	}
	impossible();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...