| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 63006 | KHUSRAV | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 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 "molecules.h"
#include<bits/stdc++.h>
using namespace std ;
int used[1000001];
vector<int> find_subset(int l, int u, vector<int> w) {
    vector< vector<int> > v;
    vector<int> y ;
    for(int i = 0 ; i <= u ; i++)
        used[i] = 0 ;
    y.push_back(0);
    v.push_back(y);
    for(int i = 0 ; i < w.size() ; i ++){
        int q = v.size();
        for(int j = 0 ; j < q ; j++){
            vector<int> g = v[j];
            if(g[0] + w[i] <= u){
                g[0] += w[i];
                g.push_back(i);
                if(used[g[0]] == 0){
                    used[g[0]] = 1 ;
                    v.push_back(g) ;
                }
                if(g[0] >= l){
                    vector<int> k ;
                    for(int j = 1 ; j < g.size() ; j ++)
                        k.push_back(g[j]);
                    return k;
                }
            }
        }
    }
    vector<int> f
    return f;
}
