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<int,int>>order(n);
for (int i=0;i<n;i++) order[i]=make_pair(w[i],i);
sort(order.begin(),order.end());
vector<int>ans;
int lf=0;
long long sum=0;
for (int r=0;r<n;r++)
{
sum+=order[r].first;
if (sum>u)
{
sum-=order[lf].first;
lf++;
}
if (sum>=l)
{
for(int i=lf;i<=r;i++) ans.push_back(order[i].second);
return ans;
}
}
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... |