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 "bits/stdc++.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
long long le, ri, sm;
le = ri = sm = 0;
vector<vector<int>> a;
for (int i = 0; i < (int) w.size(); i ++) {
a.push_back({w[i], i});
}
sort(begin(a), end(a));
while (ri < (int) a.size()) {
sm += a[ri][0];
if (sm > u) {
sm -= a[le ++][0];
}
if (l <= sm && sm <= u) {
vector<int> an;
for (int i = le; i <= ri; i ++) {
an.push_back(a[i][1]);
}
return an;
}
ri ++;
}
return 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... |