| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 777752 | JoenPoenMan | Detecting Molecules (IOI16_molecules) | C++17 | 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;
vector<int> dp[2147483748];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
for (int i = 0; i < (int)w.size(); i++) {
for (int j = l-1; j > 0; j--) {
if (dp[j].size() > 0 && j+w[i] <= u) {
dp[j+w[i]] = dp[j];
dp[j+w[i]].push_back(i);
if (j+w[i] >= l) return dp[j+w[i]];
}
}
dp[w[i]] = {i};
if (w[i] >= l && w[i] <= u) return dp[w[i]];
}
return std::vector<int>(0);
}