# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990496 | Electron1997 | 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.
vector<int> find_subset(int l, int u, vector<int> w){
int n = w.size();
vector<int> s(n);
iota(s.begin(), s.end(), 0);
sort(s.begin(), s.end(), [&w](const int& i, const int& j){
return w[i] < w[j];
});
ll cur = 0; int a = 0, b = 0, c = n;
while(b < n && cur + w[s[b]] <= u){
cur += w[s[b++]];
}
while(a < b && b < c && cur < l){
cur += w[s[--c]] - w[s[a++]];
}
vector<int> sol(0);
if(cur >= l){
sol.resize(n - c + b - a);
int j = 0;
for(int i = a; i < b; ++i){
sol[j++] = s[i] + 1;
}
for(int i = c; i < n; ++i){
sol[j++] = s[i] + 1;
}
}
return sol;
}