# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
558923 | benson1029 | A Difficult(y) Choice (BOI21_books) | C++14 | 1 ms | 208 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;
vector< pair<int,int> > v;
vector<int> ans;
void solve(int N, int K, long long A, int S) {
int l = 1, r = N, mid;
while(l<=r) {
mid = (l+r)/2;
if(skim(mid) <= A) l = mid+1;
else r = mid-1;
}
for(int i=1; i<=min(K, l); i++) {
v.push_back({skim(i), i});
}
for(int i=max(K+1, l-K); i <= min(l, N); i++) {
v.push_back({skim(i), i});
}
for(int i=0; i<(1<<v.size()); i++) {
if(__builtin_popcount(i) != K) continue;
long long sum = 0;
for(int j=0; j<v.size(); j++) {
if((i>>j)%2) sum += v[j].first;
}
if(sum >= A && sum <= 2*A) {
for(int j=0; j<v.size(); j++) {
if((i>>j)%2) ans.push_back(v[j].second);
}
answer(ans);
return;
}
}
impossible();
}
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... |