# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
940471 | ezzzay | 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 int long long
const int N=2e5+5;
#define pb push_back
#define ff first
#define ss second
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n=w.size();
vector<int>ans;
for(int i=0;i<(1<<n);i++){
vector<int>vc;
int s=0;
for(int j=0;j<n;j++){
if(i & (1<<j)){
vc.pb(j+1);
s+=w[j];
}
}
if(l<=s and s<=u){
ans=vc;
break;
}
}
return ans;
}