Submission #943077

#TimeUsernameProblemLanguageResultExecution timeMemory
943077hmm789A Difficult(y) Choice (BOI21_books)C++14
0 / 100
5 ms1212 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 a[N+1], cur = 0;
    for(int i = 1; i <= N; i++) a[i] = skim(i);
    for(int i = 1; i <= K; i++) cur += a[i];
    for(int i = K+1; i <= N; i++) {
		cur += a[i]-a[i-K];
		if(cur >= A && cur <= 2*A) {
			for(int j = i; j > i-K; j--) v.push_back(j);
			answer(v);
		} else if(cur >= A) {
			assert(a[i] >= A);
			int sm = 0;
			for(int j = 1; j < K; j++) {
				sm += a[j];
				v.push_back(j);
			}
			sm += a[i];
			v.push_back(i);
			if(sm <= 2*A) answer(v);
			else impossible();
		}
	}
	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...