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;
int const nmax = 1e4+10;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = w.size();
    vector <vector<int>> sol(u);
    bitset<nmax> vis;
    vis[0] = 1;
    for(int i = 0; i<n; i++){
        for(int j = 0; j<=u-w[i]; j++){
            if(!sol[j+w[i]].empty()) continue;
            if(vis[j]){
                vis[j+w[i]] = 1;
                vector<int> aux = sol[j];
                aux.push_back(i);
                sol[j+w[i]] = aux;
            }
        }
    }
    for(int i = l; i<=u; i++){
        if(vis[i]){
            return sol[i];
        }
    }
    return std::vector<int>(0);
}
| # | 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... |