제출 #403364

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

books

#include <bits/stdc++.h>
#include <books.h>

#define sz(v) (int)v.size()
#define pb push_back

using namespace std;


typedef long long ll;

const int N = 1e5 + 1;

bool asked[N];

ll x[N];

ll ask (int i) {
	if (asked[i]) return x[i];
	asked[i] = true;
	x[i] = skim(i);
	return x[i];
}

void solve(int n,int k,ll A,int s){
	for (int i = 1; i <= n; i++) {
		asked[i] = false;
	}

	int l = 1, r = n, R = 0;
	while (l <= r) {
		int mid = (l + r) / 2;
		if (ask(mid) > A + A) r = mid - 1;
		else R = mid, l = mid + 1;
	}
	l = 1, r = R;
	int L = 0;
	while (l <= r) {
		int mid = (l + r) / 2;
		if (ask(mid) > A) r = mid - 1;
		else L = mid, l = mid + 1;
	}
	ll sum = 0;
	vector <int> ans;
	for (int i = 1; i <= min(L, k); i++) {
		if (sum + ask(i) > A + A) break;
		sum += ask(i);
		ans.pb(i);
	}
	if (sz(ans) < k - 1){
		impossible();
	}
	if (L < R){
		if (sz(ans) < k && sum + ask(L + 1) <= A + A){
			sum += ask(L + 1);
			ans.pb(L + 1);
		}
	}
	if (sz(ans) < k || sum < A){
		impossible();
	}
	else {
		answer(ans);
	}
}

• 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