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"
using namespace std;
typedef long long ll;
vector<int> find_subset(int L, int U, vector<int> w) {
sort(w.begin(), w.end());
int l = 0, r = -1;
ll sum = 0;
vector<int> res;
while (1) {
if (sum >= L && sum <= U) {
for (int i = l; i <= r; i++) {
res.push_back(w[i]);
}
break;
}
if (sum >= L and l<=r)
sum -= w[l++];
else if (sum < L and r+1 < (int)w.size())
sum += w[++r];
else
break;
}
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... |