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;
vector<int> find_subset(int l,int u,vector<int> w){
int dp[10010];
fill(dp,dp+10010,-1);
dp[0]=0;
for(int i=0;i<(int)w.size();i++)
for(int j=u;j>=0;j--){
if(j-w[i]>=0 && dp[j-w[i]]!=-1)
if(dp[j]==-1) dp[j]=i;
}
vector<int> ans;
for(int i=l;i<=u;i++)
if(dp[i]!=-1){
int now=i;
while(now!=0){
ans.push_back(dp[now]);
now-=w[dp[now]];
}
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... |