Submission #1256163

#TimeUsernameProblemLanguageResultExecution timeMemory
1256163MasterDebaterA Difficult(y) Choice (BOI21_books)C++20
0 / 100
0 ms408 KiB
#include "books.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int binary_search(int lo,int hi,ll a){
	int res=0;
	while(lo<=hi){
		int mid=(lo+hi)/2;
		if(skim(mid)<=a)res=mid,lo=mid+1;
		else hi=mid-1;
	}
	return res;
}
void solve(int N,int K,ll A,int S){
	int L=binary_search(1,N,A-1);
	int R=binary_search(1,N,2*A);
	if(R-L>=K){
		vector<int>ans;
		for(int i=L+1;i<=L+K;i++)ans.push_back(i);
		answer(ans);
	}
	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...