# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
944326 | bngybongybrd | A Difficult(y) Choice (BOI21_books) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#include "books.h"
using namespace std;
void solve(int N, int K, long long A, int S) {
int diff[100005];
if(skim(1)*3 > 2*A){impossible();}
if(skim(N)*K < A){impossible();}
for(int i = 1; i <= S; i++){diff[i-1] = skim(i);}
int sum = 0;
for(int i = 0; i < S; i++){
sum = 0;
sum += diff[i];
for(int j = i+1; j < S; j++){
for(int x = j+1; x < S; x++){
sum += diff[j];
sum += diff[x];
if(sum >= A and sum <= 2*A){
answer({i, j, x});
}
}
}
}
impossible();
}