# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112325 | ioilolcom | 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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long int
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pair<int,int> > ww;
for(int i=0; i<(int)w.size(); i++) {
ww.push_back({w[i],i});
}
sort(ww.begin(),ww.end());
vector<int> ans;
int n=(int)w.size();
int b=0;
for(int a=0; a<n; a++) {
sum+=ww[a].x;
while(sum>u) {
sum-=ww[b++].x;
}
if(cur>=l) {
for(int k=b; k<=a; k++) {
ans.push_back(ww[k].y);
return ans;
}
}
}
return std::vector<int>(0);
}