# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
772130 | Tkm_algo | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 340 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 "bits/stdc++.h"
#include "molecules.h"
using namespace std;
using ll = long long;
const int N = 1e4 + 10;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<int> v(N);
v[0] = 1;
for (int y = 0; y < w.size(); y++) {
int x = w[y];
for (int i = N - 1; i >= 0; i--) {
if (v[i] && i + x < N) {
v[i + x] = y + 1;
}
}
}
int res = 0;
for (int i = l; i <= u; i++) {
if (v[i]) {
res = i;
break;
}
}
vector<int> ans;
while (res != 0) {
ans.push_back(v[res] - 1);
res -= w[v[res] - 1];
}
return ans;
}
// int main() {
// ios::sync_with_stdio(false);
// cin.tie(0);
// int l, u;
// cin >> l >> u;
// int n;
// cin >> n;
// vector<int> w;
// for (int i = 0; i < n; i++) {
// int x;
// cin >> x;
// w.push_back(x);
// }
// vector<int> ans = find_subset(l, u, w);
// for (auto x : ans) {
// cout << x << ' ';
// }
// }
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... |