# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
392107 | SlavicG | 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.
vector<int> find_subset(int u, int v, std::vector<int> c)
{
int n = sz(c);
vector<pair<int,int>> a(n);
for(int i = 0;i < n;i++){
a[i].first = c[i];
a[i].second = i;
}
sort(all(a));
vector<int> ret;
ll w = 0;
pair<int,int> ans = {-1, -1};
for(int i = 0, j = 0;i < n;i++)
{
if(i)w -= a[i - 1].first;
while(j < n && w < u)
{
w += a[j].first;
if(w <= v && w >= u){
vector<int> ret;
for(int k = i;k <= j;k++){
ret.pb(a[k].second + 1);
}
return ret;
}
++j;
}
}
return {};
}