제출 #1115478

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1115478		Dan4Life	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	2 ms	1104 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;
ll A, a[N];

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;
}

void solve(int _N, int _K, ll _A, int S) {
	n = _N; A=_A,K=_K; 
	vi ans(K,0); iota(all(ans),1);
	memset(a,-1,sizeof(a));
	ll sum = getSum(1,K);
	if(sum>2*A) impossible();
	if(sum>=A) answer(ans);
	int l = 1, r = n;
	while(l<r){
		int mid = (l+r)/2;
		if(Skim(mid)>A) r=mid;
		else l=mid+1;
	}
	if(sum+a[l]-a[K]<=2*A) ans[K-1] = l, answer(ans);
	deque<int> ans2(K,0); iota(all(ans2),1);
	for(int i = 1; i <= K; i++){
		sum-=a[i]; ans2.pop_front();
		if(l-i<=i) break; 
		sum+=a[l-i]; ans2.push_back(l-i);
		if(sum<=2*A) answer(vi(all(ans2)));
	}
	impossible();
}

• 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