# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305532 | juggernaut | 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<bits/stdc++.h>
using namespace std;
vector<int>find_subset(int a,int b,vector<int>w){
vector<int>ans;
vector<pair<int,int>>v;
int i,sum=0,l,r=0;
for(;r<w.size();r++)v.push_back({w[r],r});
sort(v.begin(),v.end());
for(r=0;r<w.size();r++){
sum+=v[i].first;
while(sum>r)sum-=v[j++].first;
if(sum>=l){
for(;l<=r;l++)ans.push_back(v[l].second);
return ans;
}
}
return {};
}