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 ll long long
using namespace std;
pair<int,int>v[200005];
vector<int> find_subset(int l,int u,vector<int>w)
{
int n=w.size();
int i;
for(i=0;i<n;i++)
v[i]={w[i],i};
sort(v,v+n);
int dr=0;
ll sum=0;
vector<int>ans;
for(i=0;i<n;i++){
while(dr<n && sum<l){
sum+=v[dr].first;
dr++;
}
if (sum>=l && sum<=u){
int j;
for(j=i;j<dr;j++)
ans.push_back(v[j].second);
break;
}
sum-=v[i].first;
}
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... |