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>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n=w.size();
vector<pair<long long,int> >r;
vector<int> rr;
for(int i=0;i<n;i++){
r.push_back(make_pair(w[i],i));
}
sort(r.begin(),r.end());
long long rt=0;
int p1=0,p2=n-1;bool x=false;
while(rt<=u && p2>p1){
if(rt+r[p2].first<=u){
rr.push_back(r[p2].second);
rt=rt+r[p2].first;
p2--;
}
else {
rr.push_back(r[p1].second);
rt=rt+r[p1].first;
p1++;
}
if(rt>=l && rt<=u){x=true;
break;
}
}
sort(rr.begin(),rr.end());
if(!x)rr.clear();
return rr;
}
# | 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... |