Submission #943019

#TimeUsernameProblemLanguageResultExecution timeMemory
943019hmm789A Difficult(y) Choice (BOI21_books)C++14
10 / 100
1 ms596 KiB
#include <bits/stdc++.h>
#include "books.h"
using namespace std;

void solve(int N, int K, long long A, int S) {
	vector<int> v;
    #define int long long
    int l = 1, r = N-K+1, m;
    while(l < r) {
		m = (l+r)/2;
		int sm = 0;
		for(int i = 0; i < K; i++) sm += skim(m+i);
		if(sm < A) l = m+1;
		else r = m;
	}
	int sm = 0;
	for(int i = 0; i < K; i++) sm += skim(l+i);
	if(sm >= A && sm <= 2*A) {
		for(int i = 0; i < K; i++) v.push_back(l+i);
		answer(v);
	} else impossible();
	#undef int
}
#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...