# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
289186 | NicolaAbusaad2014 | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KiB |
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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<long> find_subset(long l,long r,vector<long long>w)
{
vector<pair<long long,long> >x,v;
for(long i=0;i<w.size();i++){
x.push_back(make_pair(w[i],i));
}
sort(w.begin(),w.end());
vector<long>ans;
long long sum=0,now=0;
bool ok=false;
for(long i=0;i<w.size();i++){
if(sum<l){
sum+=x[i].first;
v.push_back(make_pair(x[i].first,x[i].second));
}
if(sum>r){
sum-=v[now].first;
now++;
}
if(sum>=l&&sum<=r){
ok=true;
break;
}
}
if(ok){
for(long i=now;i<v.size();i++){
ans.push_back(v[i].second);
}
}
return ans;
}