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"
//#include "grader.cpp"
using namespace std ;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n = w.size() , r = u ;
vector< pair<long long , int> >vp ;
for(int i = 0 ; i < n ; ++i)
vp.push_back({w[i] * 1ll , i}) ;
sort(vp.begin() , vp.end()) ;
vector<int>ans ;
int x = 0 ;
long long sum = 0 ;
for(int i = 0 ; i < n ; ++i)
{
sum += vp[i].first ;
while(x <= i && sum > r)
{
sum -= vp[x].first ;
++x ;
}
if(sum >= l && sum <= r)
{
for(int j = x ; j <= i ; ++j)
ans.push_back(vp[j].second) ;
break ;
}
}
sort(ans.begin() , ans.end()) ;
return ans ;
}
# | 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... |