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