# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
987227 | VMaksimoski008 | A Difficult(y) Choice (BOI21_books) | C++17 | 11 ms | 852 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;
using ll = long long;
void solve(int N, int K, ll A, int S) {
if(N == S && K == 3) {
vector<ll> v;
for(int i=0; i<N; i++) v.push_back(skim(i+1));
for(int i=0; i<N; i++) {
for(int j=i+1; j<N; j++) {
if(v[i] + v[j] > 2 * A) continue;
ll left = A - v[i] - v[j];
auto p = lower_bound(v.begin(), v.end(), left) - v.begin();
if(p == i) p++;
if(p == j) p++;
if(p >= N) continue;
if(v[i] + v[j] + v[p] >= A && v[i] + v[j] + v[p] <= 2 * A)
answer({ i+1, j+1, p+1 });
}
}
impossible();
return ;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |