제출 #1115459

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1115459		Dan4Life	A Difficult(y) Choice (BOI21_books)	C++17	10 / 100	5 ms	2128 KiB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using ll = long long;
using vi = vector<int>;
const int N = (int)1e5+10;
int n, K, ind;
ll A, a[N];
vi ans;

ll Skim(int i){
	if(a[i]!=-1) return a[i];
	return a[i]=skim(i);
}
 
ll getSum(int mid, int num){
	ll s = 0;
	for(int j = mid; j < mid+num; j++) s+=Skim(j);
	return s;
}

int bsearch(ll x){
	int l = 1, r = n;
	while(l<r){
		int mid = (l+r)/2;
		if(Skim(mid)>=x) r=mid;
		else l=mid+1;
	}
	return l;
}

ll chk(int mid){
	ll sum = getSum(mid,K);
	ans.resize(K,0); iota(all(ans),mid);
	if(sum>=A and sum<=2*A){ answer(ans); exit(0); }
	ll rt = sum;
	if(a[mid+K-1]<A and ind>=mid+K and ind<=n and a[ind]>=A){
		sum=sum-a[mid+K-1]+a[ind];
		if(sum>=A and sum<=2*A){ ans[mid+K-1]=ind; answer(ans); exit(0); }
	}
	return rt;
}

void solve(int _N, int _K, ll _A, int S) {
	n = _N; A=_A,K=_K;
	memset(a,-1,sizeof(a));
	ans.resize(K,0);
	int l = 1, r = n-K+1;
	ind = bsearch(A);
	while(l<r){
		int mid = (l+r)/2;
		if(chk(mid)>2*A) r=mid-1;
		else l=mid+1;
	}
	chk(l); impossible();
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 10 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20