# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1115209 | Zflop | Detecting Molecules (IOI16_molecules) | C++14 | 39 ms | 65536 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.
#pragma once
#include <bits/stdc++.h>
#include <vector>
using namespace std;
const int NMAX = (int)1e3 * 2;
int dp[NMAX],from[NMAX];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
dp[0] = 1;
for (int i = 0; i < u;++i) from[i] = -1;
for (int i = 0; i < w.size();++i) {
for (int j = u + 1; j >= 0;--j)
if (dp[j]) {
dp[j + w[i]] = 1;
from[j] = i;
}
}
vector<int>v;
int este = 0;
for (int i = u; i >= l;--i)
if (dp[i]) {
este = i;
break;
}
v.push_back(este);
while (from[v.back()] != -1) {
v.push_back(from[v.back()]);
}
return v;
}
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... |