# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319977 | CursedCode | 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;
std::vector<int> find_subset(int l, int u,std::vector<int> w){
vector<pair<int,int>> x;
for(int i = 0;i<=w.size;i++){
x.push_back(make_pair(w[i],i))
}
sort(x.begin(),x.end());
int n = x.size();
int L = 0;
int R = 0;
long long sum = 0;
vector<int> a;
while(R < n){
sum += x[R].first;
while(sum > u && L <= R) sum-= x[L].first, L++;
if(sum >= l){
for(int i = L;i <= R;i++) a.push_back(x[i].second);
break;
}
R++;
}
return a;
}