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"
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int taken = 0, sum = 0;
int n = w.size();
std::vector<int> res;
// adăugăm obiecte pe rând până când suma devine mai mare decât l
while (taken < n && sum < l) {
res.push_back(taken);
sum += w[taken];
taken++;
}
if (l <= sum && sum <= u)
return res;
// dacă nu am găsit soluție, returnăm un vector gol
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... |