# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676997 | Dulguun | Detecting Molecules (IOI16_molecules) | C++17 | 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;
int find_subset(int l, int u, int w[], int n, int result[]){
vector<pair<int,int>> v(n);
for(int i=0; i<n; i++) v[i]={w[i], i};
sort(v.begin(), v.end());
for(int k=n; k>0; k++){
int s=0;
for(int i=0; i<k; i++) s+=v[i].first;
if(s>=l && s<=u) {
for(int j=0; j<k; j++) result[j]=v[j].second;
return k;
}
for(int i=k; i<n; i++){
s=s+v[i].first-v[i-k].first;
if(s>=l && s<=u) {
for(int j=i-k; j<i; j++) result[j]=v[j].second;
return k;
}
}
}
}