# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330086 | saarthak | 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> w;
int[] find_subset(int l, int u, int[] w) {
if(u == l) return {w[0]}; //if the range is 0, all weights are same, return any
int total_weight = 0, i = 0;
queue<int> indices;
sort(w.begin(), w.end());
while(total_weight < l) {
total_weight += w[i];
indices.push(i++);
}
i = 0;
while(total_weight > u) {
total_weight -= w[i++];
indices.pop();
}
if(total_weight < l || total_weight > u) return int[]; //no subarray found
int ans[indices.size()];
i = 0;
while(!indices.empty()) {
ans[i++] = indices.front();
indices.pop();
}
return ans;
}