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"
#define fi first
#define se second
using namespace std;
vector<int> find_subset(int l,int u,vector<int> w)
{
vector<pair<int,int>> xd;
for(unsigned i=0;i<w.size();i++)
xd.push_back({w[i],i});
sort(xd.begin(),xd.end());
long long s=0;
int n=w.size(),i,j;
vector<int> res;
for(i=0;i<n && s<l;i++)
s+=xd[i].fi;
if(u<s)
s-=xd[--i].fi;
int m=i-1;
for(j=0;j<=m && n-j-1>m && s<l;j++)
{
s+=xd[n-j-1].fi;
s-=xd[j].fi;
}
if(s<l || u<s)
return res;
for(i=j;i<=m;i++)
res.push_back(xd[i].se);
for(i=0;i<j;i++)
res.push_back(xd[n-i-1].se);
return res;
}
# | 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... |