# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
900455 | simona1230 | 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;
long long n,k,a,s;
long long x[120001];
void solve(long long N,long long K,long long A,long long S)
{
n=N;
k=K;
a=A;
s=S;
for(long long i=1;i<=n;i++)
{
x[i]=skim(i);
}
for(long long i=1;i<=n;i++)
{
for(long long j=i+1;j<=n;j++)
{
for(long long k=j+1;k<=n;k++)
{
long long s=x[i]+x[j]+x[k];
if(a<=s&&s<=2*a)
{
answer({i,j,k});
return;
}
}
}
}
impossible();
}