# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
465207 | dattranxxx | Detecting Molecules (IOI16_molecules) | C++11 | 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.
/*
* Author : shora
*/
#include <bits/stdc++.h>
#define print(_v) for (auto &_ : _v) {cerr << _ << ' ';} cerr << endl;
#include "molecules.h"
using namespace std;
using ll = long long;
const int oo = 1e9;
const int N = 100;
int dp[N][1001];
int n;
int call(int i, int l, vector<int>& a) {
if (i == -1)
return l <= 0 ? 0 : oo;
if (l <= 0)
return 0;
if (dp[i][l])
return dp[i][l];
return dp[i][l] = min(call(i-1, l-a[i], a) + a[i], call(i-1, l, a));
}
vector<int> find_subset(int l, int u, vector<int> a) {
n = a.size();
vector<int> res;
if (call(n-1, l, a) > u)
return res;
int i = n-1;
while (~i) {
if (call(i-1, l-a[i], a) + a[i] < call(i-1, l, a)) {
res.push_back(i);
l -= a[i];
}
i--;
}
return res;
}
int main() {
int l, u;
cin >> n >> l >> u;
vector<int> a(n);
for (int& x : a)
cin >> x;
vector<int> res = find_subset(l, u, a);
print(res);
}