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 = (int)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());
long long sum = 0;
vector<int> answer;
for(int i = 0, j = 0; j < n; ++j){
sum += v[j].first;
while(sum > u)
sum -= v[i++].first;
if(sum >= l){
for(int k = i; k <= j; ++k)
answer.push_back(v[k].second);
return answer;
}
}
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... |