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;
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
vector <int> ans;
pair <long long,long long> p[200005];
long long n=w.size();
for (long long i=0;i<n;i++)
{
p[i]={w[i],i};
}
sort(p,p+n);
long long cur=0;
for (long long i=0,j=0;j<n;j++)
{
cur+= (p[j].first);
while (cur>u)
{
cur-=p[i].first;
i++;
}
if (cur>=l)
{
for (long long q=i;q<=j;q++)
{
ans.push_back(p[q].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... |