# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
469896 | IvnF | 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"
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
long long n=w.size(), kiri=0, sums=0, i=0;
std::vector<long long>ans;
for(;i<n;++i){
sums+=w[i];
while(sums > u) sums-=w[kiri++];
if(sums>=l && sums<=u){
for(long long j=kiri;j<=i;++j) ans.push_back(j);
return ans;
}
}
return ans;
}