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 "molecules.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l,int u,vector<int> w){
int n=w.size();
vector<pair<int,int>> vec;
for(int i=0;i<n;i++)vec.emplace_back(w[i],i);
sort(vec.begin(),vec.end());
int idx=0;
long long sum=0;
for(int i=0;i<n;i++){
sum+=vec[i].first;
while(sum>u)sum-=vec[idx++].first;
if(l<=sum){
vector<int> ans;
while(idx<=i)ans.emplace_back(vec[idx++].second);
return ans;
}
}
return vector<int>(0);
}
# | 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... |