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;
const long long MXN = 10000000000;
std::vector<int> find_subset(int l, int u, std::vector<int> arr) {
int n = arr.size();
bitset<MXN>dp;
dp[0]=1;
for (int i = 0;i<n;++i){
dp|=(dp<<arr[i]);
}
int val =-1;
for (int i = l;i<=u;++i){
if (dp[i]){
val = i;
break;
}
}
//cout<<val<<'\n';
vector<int>ans;
int index = n;
while(index>0&&val>0){
if (dp[val-arr[index-1]]){
ans.push_back(index-1);
val-=arr[index-1];
}
index--;
}
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... |