제출 #1187161

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1187161		kl0989e	A Difficult(y) Choice (BOI21_books)	C++20	10 / 100	3 ms	412 KiB

books

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

#define ll long long
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define pi pair<int, int>
#define pl pair<ll,ll>
#define all(x) (x).begin(),(x).end()

void solve(int n, int k, ll a, int s) {
	if (n==s) {
		vl vals(n);
		for (int i=0; i<n; i++) {
			vals[i]=skim(i+1);
		}
		if (accumulate(vals.begin(),vals.begin()+k,0ll)>2*a || accumulate(vals.end()-k,vals.end(),0ll)<a) {
			impossible();
		}
		for (int i=0; i<n; i++) {
			for (int j=i+1; j<n; j++) {
				ll sum=vals[i]+vals[j];
				int ind=lower_bound(vals.begin()+j+1,vals.end(),a-sum)-vals.begin();
				if (ind<=j || ind>n) {
					continue;
				}
				if (sum+vals[ind]<=2*a) {
					answer({i+1,j+1,ind+1});
				}
			}
		}
		impossible();
	}
	else {
		int l=0,r=n-k;
		while (l<=r) {
			int m=l+(r-l)/2;
			ll sum=0;
			for (int i=m; i<m+k; i++) {
				sum+=skim(i+1);
			}
			if (sum<a) {
				l=m+1;
			}
			else if (sum>2*a) {
				r=m-1;
			}
			else {
				vi inds(k);
				iota(all(inds),m+1);
				answer(inds);
			}
		}
		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