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;
vector<pair<int,int>> a(n);
for (int i = 0; i < n; i++) a[i] = {w[i], i};
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
r = max(r, i);
if (i == r) sum = a[i].first;
while (r+1 < n && sum + a[r+1].first <= u) {
r++;
sum += a[r].first;
}
if (sum >= l && sum <= u) {
vector<int> ans;
for (int j = l; j <= r; j++) {
ans.push_back(a[j].second+1);
}
return ans;
}
sum -= a[i].first;
}
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... |