제출 #1189742

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1189742		PlayVoltz	A Difficult(y) Choice (BOI21_books)	C++20	0 / 100	1 ms	1176 KiB

books

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

#define pb push_back

void solve(int n, int k, long long a, int s){
	#define int long long
	int sum=0;
	signed low=k-1, high=n+1;
	vector<int> vect(n+1);
	vector<signed> ans, temp;
	for (int i=1; i<=k; ++i)vect[i]=skim(i), sum+=vect[i];
	if (sum>2*a){
		impossible();
		return;
	}
	if (sum>=a){
		for (int i=1; i<=k; ++i)ans.pb(i);
		answer(ans);
		return;
	}
	sum-=vect[k];
	while (low+1<high){
		int mid=(low+high)/2;
		vect[mid]=skim(mid);
		if (sum+vect[mid]>=a)high=mid;
		else low=mid;
	}
	if (sum+vect[high]<=2*a){
		for (int i=1; i<k; ++i)ans.pb(i);
		ans.pb(high);
		answer(ans);
		return;
	}
	for (int i=1; i<=k; ++i)temp.pb(i);
	for (int i=max(k+1, high-k); i<high; ++i)vect[i]=skim(i), temp.pb(i);
	for (int i=k; i<=temp.size(); ++i){
		int sum=0;
		for (int j=i-k; j<i; ++j)sum+=vect[temp[j]];
		if (a<=sum&&sum<=2*a){
			for (int j=i-k; j<i; ++j)ans.pb(temp[j]);
			answer(ans);
			return;
		}
	}
	impossible();
	#undef int
}

• 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