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 "molecules.h"
#include <bits/stdc++.h>
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n = w.size();
std::vector<int> ord(n); std::iota(ord.begin(), ord.end(), 0);
std::sort(ord.begin(), ord.end(), [&](int i, int j) {
return w[i] < w[j];
});
std::vector<int> res;
long long cur = w[ord[0]];
for (int i = 0, j = 1; i < n; ++i) {
while (j < n && cur < l) {
cur += w[ord[j++]];
}
if (l <= cur && cur <= u) {
for (int k = i; k < j; ++k) {
res.push_back(ord[k]);
}
break;
}
cur -= w[ord[i]];
}
return res;
}
# | 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... |