# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1244376 | SpyrosAliv | Detecting Molecules (IOI16_molecules) | C++17 | 88 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
const int MN = 1e4+5;
const int MV = 1e4+5;
int dp[MV];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n = w.size();
for (int i = 0; i < MV; i++) dp[i] = -1;
dp[0] = -2;
for (int i = 0; i < n; i++) {
for (int j = u; j >= w[i]; j--) {
if (dp[j - w[i]] != -1 && dp[j] == -1) dp[j] = i;
}
}
vector<int> ans;
for (int i = l; i <= u; i++) {
if (dp[i] != -1) {
int lst = i;
while (dp[lst] != -2) {
ans.push_back(dp[lst]);
lst = lst - w[dp[lst]];
}
break;
}
}
return ans;
}
Compilation message (stderr)
# | 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... |