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) {
int n = w.size();
bool dp[10005][10005] = {false};
for (int i = 0 ; i <= n ; i++){
dp[i][0] = true;
}
for (int j = 0 ; j <= u ; j++){
for (int i = 0 ; i < n ; i++){
if (w[i] <= j)dp[i+1][j]|= dp[i][j - w[i]];
dp[i+1][j]|= dp[i][j];
}
}
int k = -1;
for (int i = l ; i <= u ; i++){
if (dp[n][i]){
k = i;
break;
}
}
vector<int> ans;
if (k == -1)return ans;
for (int i = n ; i >= 1 ; i--){
if (dp[i-1][k - w[i - 1]]){
ans.push_back(i - 1);
k-= w[i-1];
if (k == 0)return ans;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |