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"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
int sum = w[0];
int r = 0;
sort(w.begin(), w.end());
for (int i = 0; i < n; i++) {
r = max(r, i);
while (r+1 < n && sum + w[r+1] <= u) {
r++;
sum += w[r];
}
if (sum >= l && sum <= u) {
vector<int> a(r-i+1);
iota(a.begin(), a.end(), i+1);
return a;
}
sum -= w[i];
}
return 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... |