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 <algorithm>
using ll = long long;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
sort(w.begin(), w.end());
int n = w.size();
ll sum = 0, mn = 1e15;
for (ll x : w){ sum += x; mn = std::min(mn, x); }
if (u < mn || sum < l){ return std::vector<int>(); }
int st = 0, ed = 0; sum = w[0];
while (1){
if (l <= sum && sum <= u){
std::vector<int> res;
for (int i = st; i <= ed; i++){ res.push_back(i); }
return res;
}
if (sum < l){
if (ed+1 == n){ break; }
ed += 1;
sum += w[ed];
}
else{
sum -= w[st];
st += 1;
}
}
return std::vector<int>();
}
# | 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... |