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"
using namespace std;
bool valid[500001];
vector<int> find_subset(int l, int u, vector<int> w) {
int n=w.size();
int parent[u+1];
int arr[1000000];
int ind=1;
arr[0]=0;
valid[0]=true;
int foundval=-1;
for(int i=0;i<n;i++){
int newind=ind;
for(int j=0;j<ind;j++){
int newindex=arr[j]+w[i];
if(newindex>u ||valid[newindex]==true)continue;
arr[newind]=newindex;
newind++;
valid[newindex]=true;
parent[newindex]=i;
if(l<=newindex && newindex<=u){
foundval=newindex;
break;
}
}
if(foundval!=-1)break;
ind=newind;
}
vector<int> ans;
if(foundval!=-1){
while(foundval!=0){
ans.push_back(parent[foundval]);
foundval-=w[parent[foundval]];
}
}
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... |