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;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int it = 100000;
vector<pair<int,int>> v;
int n = w.size();
for (int i = 0 ; i < n ; i++) {
v.push_back({w[i], i});
}
while (it--) {
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
int sm = 0;
int i = 0;
for (; i < n ; i++) {
sm += v[i].first;
if (sm >= l) {
break;
}
}
if (sm >= l and sm <= u) {
vector<int> ret;
for (int j = 0 ; j <= i ; j++) {
ret.push_back(v[j].second);
}
return ret;
}
}
return {};
}
# | 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... |