# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787884 | YassirSalama | Detecting Molecules (IOI16_molecules) | C++14 | 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 "molecules.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN=200;
const int MAXM=100000;
int dp[MAXN][MAXM];
int L,U;
bool ok=false;
vector<int> ans;
vector<int> v;
int anns=0;
bool solve(int i,int sum,vector<int> a){
if(sum>U) return dp[i][sum]=0;
if(dp[i][sum]!=-1) return dp[i][sum];
// anns++;
if(L<=sum&&sum<=U){
ans=a;
ok=true;
return dp[i][sum]=1;
}
if(i==v.size()) return dp[i][sum]=0;
if(ok) return dp[i][sum]=1;
vector<int> x=a;
x.push_back(i);
anns++;
bool aa=solve(i+1,sum+v[i],x);
if(aa) return dp[i][sum]=1;
if(ok) return dp[i][sum]=1;
bool bb=solve(i+1,sum,a);
if(bb) return dp[i][sum]=1;
if(ok) return dp[i][sum]=1;
return dp[i][sum]=(aa|bb);
}
vector<int> find_subset(int l, int u, vector<int> w) {
L=l;
U=u;
v=w;
memset(dp,-1,sizeof(dp));
solve(0,0,vector<int>(0));
// cout<<anns<<endl;
if(ok) return ans;
//If no such subset
return vector<int>(0);
}
int main() {
int n, l, u;
assert(3 == scanf("%d %d %d", &n, &l, &u));
std::vector<int> w(n);
for (int i = 0; i < n; i++)
assert(1 == scanf("%d", &w[i]));
std::vector<int> result = find_subset(l, u, w);
printf("%d\n", (int)result.size());
for (int i = 0; i < (int)result.size(); i++)
printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}