제출 #412581

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
412581		cfalas	A Difficult(y) Choice (BOI21_books)	C++14	0 / 100	4 ms	456 KiB

books

#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

#include "books.h"

using namespace std;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
//     books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ books_sample.cpp sample_grader.cpp
// in this folder.
//

void solve(int n, int K, long long A, int S) {
	assert(K==3);
	assert(S>=n);
	vi a(n);
	FOR(i,n) a[i] = skim(i+1);
	FOR(i,n-1) assert(a[i+1]>a[i]);
	FOR(i,n-2){
		FORi(j,i+1,n-1){
			int x=lower_bound(a.begin()+j+1, a.end(), A - a[i]-a[j]) - a.begin();
			if(x>=n) continue;
			if(A<=a[x]+a[i]+a[j] && a[x]+a[i]+a[j]<=2*A){
				assert(x>j && x>i);
				answer({i+1, j+1, x+1});
				return;
			}
		}
	}
	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