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 "molecules.h"
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int le, ri, sm;
le = ri = sm = 0;
std::sort(begin(w), end(w));
while (ri < (int) w.size()) {
sm += w[ri];
if (sm > u) {
sm -= w[le];
le ++;
}
if (sm >= l && sm <= u) {
std::vector <int> v;
for (int i = le; i <= ri; i ++) {
v.push_back(i);
}
return v;
}
ri ++;
}
return std::vector<int>(0);
}
# | 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... |