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>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w)
{
int n = size(w);
vector<long long> s(n + 1);
vector<int> id(n);
iota(begin(id), end(id), 0);
sort(begin(id), end(id), [&](int u, int v) { return w[u] < w[v]; });
for (int i = 0; i < n; i++)
s[i + 1] = s[i] + w[id[i]];
for (int k = 1; k <= n; k++)
{
if (s[k] > u || s[n] - s[n - k] < l)
continue;
for (int i = k; i <= n; i++)
if (l <= s[i] - s[i - k] && s[i] - s[i - k] <= u)
{
vector<int> ans;
for (int j = i - k; j < i; j++)
ans.push_back(id[j]);
sort(begin(ans), end(ans));
return ans;
}
}
return {};
}
# | 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... |