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;
struct S {
int b = 0;
vector<int> ind;
};
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int s = 0;
for (int i : w) {
s += i;
}
vector<S> ok(10000+1);
ok[0].b = 1;
int cnt = 0;
for (int i : w) {
for (int j = 10000; j>=i; j--) {
if(ok[j-i].b) {
ok[j].ind = ok[j-i].ind;
ok[j].b = 1;
(ok[j].ind).push_back(cnt);
}
}
cnt++;
}
vector<int> ans;
for (int i = l; i<=u; i++) {
if(i > s) {
break;
}
if(ok[i].b) {
return ok[i].ind;
}
}
return ans;
}
# | 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... |