# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
318430 | study | 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 "molecules.h"
#define int long long
using namespace std;
vector<int> find_subset(int l, int u, vector<int> v) {
vector<int> ans;
int n = v.size();
int s=0,beg = 0, end = 0;
while (end < n){
if (s < l){
s += v[end];
end++;
}
else if (s > u){
s -= v[beg];
beg++;
}
if (s >= l and s <= u){
for (int i=beg; i<=end-1; ++i){
ans.emplace_back(i);
}
return ans;
}
}
return vector<int>(0);
}