# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154789 | Mercenary | 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>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int l, int u, std::vector<int> w) {
typedef pair<int,int> ii;
vector<ii> v(w.size());
for(int i = 0 ; i < (int)w.size() ; ++i){
v[i] = mp(w[i] , i);
}
vector<int> ans;
sort(v.begin(),v.end());
int jj = 0;
int sum = 0;
for(int i = 0 ; i < (int)w.size() ; ++j){
while(jj < (int)w.size() && sum + w[jj].first <= u)sum += w[jj++].first;
if(sum >= l){
for(int j = i ; j < jj ; ++j)ans.pb(w[j].second);
return ans;
}
sum -= w[i].first;
}
return ans;
}