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){
sort(w.begin(), w.end());
vector<int> vec;
int sum = w[0], n = w.size();
if(l <= sum && sum <= u){ vec.push_back(0); return vec;}
int L = 0, R = 1;
while(R<n){
if(sum<=u) sum += w[R++];
if(sum>u) sum -= w[L++];
if(l<=sum && sum<=u){
for(int i = L; i < R; i++) vec.push_back(i);
break;
}
}
return vec;
}
# | 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... |