This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Ignut
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> find_subset(int L, int U, vector<int> w) {
int n = w.size();
vector<pair<int, int>> v;
for (int i = 0; i < n; i ++) v.push_back({w[i], i});
sort(v.begin(), v.end());
for (int l = 0; l < n; l ++) {
ll sum = 0;
for (int r = l; r < n; r ++) {
sum += v[r].first;
if (sum > U) break;
if (sum < L) continue;
vector<int> res;
for (int i = l; i <= r; i ++) res.push_back(v[i].second);
return res;
}
}
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... |