# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683152 | Juan | 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.
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ff first
#define ss second
vector<int> ans;
vector<pii> arr;
int ll, uu;
bool dp(int id, int sum){
if(sum>uu) return false;
if(sum>=ll && sum<=uu) return true;
for(int i = id; i < arr.size(); i++){
if(dp(i+1, sum+arr[i].ff)){
ans.push_back(arr[i].ss);
return true;
}
}
return false;
}
int[] find_subset(int l, int u, int[] w){
ll = l, uu = u;
for(int i = 0; i < sizeof w; i++) arr.push_back({w[i], i});
sort(arr.begin(), arr.end(), greater<pii>());
dp(0, 0);
return ans;
}