# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
843204 | Mr_Husanboy | 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>
#include "molecules.h"
using namespace std;
template<typename T>
int len(T &a){return a.size();}
vector<int> find_subset(int l, int u, vector<int> w) {
int n = len(w);
vector<int> dp(u + 1);
dp[0] = 1;
vector<int> par(u + 1);
for(int i = 0; i < n; i ++){
for(int j = u; j >= w[i]; j --){
if(!dp[j] && dp[j - w[i]]){
par[j] = i;
dp[j] = 1;
}
}
}
int yes = -1;
for(int i = l; i <= u; i ++) if(dp[i]) yes = i;
if(yes == -1) return {};
vector<int> ans;
while(yes != 0){
ans.push_back(par[yes]);
yes -= w[par[yes]];
}
reverse(all(ans));
return ans;
}