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;
using ll = long long;
vector<int> find_subset(int l, int u, std::vector<int> W) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n = W.size();
vector <pair <ll, int>> w(n);
for (int i = 0; i < n; i++)
w[i] = {W[i], i};
sort(w.begin(), w.end());
ll sum = 0;
int lp = 0, rp = 0;
vector <int> ans;
while (rp <= n) {
if (sum < l) {
if (rp < n)
sum += w[rp++].first;
else
return ans;
}
else if (sum > u)
sum -= w[lp++].first;
if (sum >= l && sum <= u) {
sum = 0;
for (int i = lp; i < rp; i++) {
ans.push_back(w[i].second);
}
return ans;
}
}
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... |