| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 657594 | TimDee | 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"books.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int n, int k, int A, int s) {
if (s!=n) return;
vector<int> a(n);
for (int i=0; i<n; ++i) a[i]=skim(i+1);
if (k==3) {
for (int i=0; i<n; ++i) {
for (int j=i+1; j<n; ++j) {
int l=j+1, r=n;
while (l<r) {
int mid=(l+r)>>1;
if (a[i]+a[j]+a[mid]<A) l=mid+1;
else r=mid;
}
if (a[i]+a[j]+a[r]<=2*A) {
answer({i+1,j+1,r+1});
return;
}
}
}
impossible();
}
}