제출 #1115496

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

books

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

void solve(int n, int K, ll A, int S) {
	vi ans(K,0); iota(all(ans),1);
	for(int i = 1; i <= K; i++) 
		a[i]=skim(i), sum+=a[i];
	if(sum>2*A) impossible();
	int l = 1, r = n;
	while(l<r){
		int mid = (l+r)/2;
		if(skim(mid)>A) r=mid;
		else l=mid+1;
	}
	deque<int> ans2(K,0); iota(all(ans2),1);
	for(int i = 1; i <= K+1; i++){
		if(sum>=A) answer(vi(all(ans2)));
		if(l-i<=i) break;
		sum-=a[i]; ans2.pop_front();
		sum+=skim(l-i); ans2.push_back(l-i);
	}
	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