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