| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1175048 | FZ_Laabidi | Detecting Molecules (IOI16_molecules) | C++20 | 1092 ms | 27288 KiB | 
#include "molecules.h"
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = w.size();
    vector<bool> poss(u+1, false);
    poss[0]= true;
    vector<vector<int>> dp(u+1);
    for(int i=0; i<n; i++){
        for(int j=u; j>=w[i]; j--){
            if(poss[j-w[i]]){
                poss[j]= true;
                dp[j]= dp[j-w[i]];
                dp[j].push_back(i);
            }
        }
    }
    for(int i=l; i<=u; i++){
        if(poss[i])return dp[i];
    }
    return {};
}
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... | ||||
