Submission #1032324

#	Time	Username	Problem	Language	Result	Execution time	Memory
1032324		Marco_Escandon	A Difficult(y) Choice (BOI21_books)	C++14	5 / 100	121 ms	1112 KiB

books

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const string ny[2] = {"No", "Yes"};
#include"books.h"
void solve(int n, int k, long long a, int S) {
	ll cad[n+4]={ };
	ll v[k+2]={ },ac=0;
	v[k]=n+3;
	for(int i=1; i<=n; i++)
	{
		cad[i]=skim(i);
		if(i<=k)
		{
			v[i-1]=i;
			ac+=cad[i];
		}
	}
	/*for(int i=k-1; i>-1; i--)
	{
		ll temp=ac-cad[v[i]]+cad[v[i]+1];
		while(temp<2*a&&ac<a&&v[i]<v[i+1]-1&&v[i]<n)
		{
			ac-=cad[v[i]];
			v[i]++;
			ac+=cad[v[i]];
			temp=ac-cad[v[i]]+cad[v[i]+1];
		}
	}*/
	for(int i=0; i<n; i++)
	{
		for(int j=i+1; j<n; j++)
		{
			for(int l=j+1; l<n; l++)
			{
				if(cad[i+1]+cad[j+1]+cad[l+1]>=a&&cad[i+1]+cad[j+1]+cad[l+1]<=2*a)
				{
					answer({i+1,j+1,l+1});
					return;
				}
			}
		}
	}
	if(ac<a||ac>2*a)
		impossible();
	vector<int> ans;
	for(int i=0; i<k; i++)
		ans.push_back(v[i]);
	answer(ans);
}

• Subtask 1: 5 / 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