| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1211202 | madamadam3 | Detecting Molecules (IOI16_molecules) | C++20 | 122 ms | 532 KiB | 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
const int MAX_SUM = 10'000;
vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<int> par(MAX_SUM + 1, -1);
    for (int i = 0; i < n; i++) {
        for (int j = MAX_SUM; j - w[i] > 0; j--) {
            if (par[j] != -1) continue;
            if (par[j - w[i]] == -1) continue;
            par[j] = i;
        }
        if (par[w[i]] == -1) par[w[i]] = i;
    }
    
    vector<int> ans;
    int first_valid = 0;
    for (int i = l; i <= u; i++) {
        if (par[i] != -1) {
            first_valid = i;
            break;
        }
    }
    
    // for (int i = 0; i <= u; i++) {
    //     cout << i << "\t";
    // }
    // cout << "\n";
    // for (int i = 0; i <= u; i++) {
    //     cout << par[i] << "\t";
    // }
    // cout << "\n";
    while (first_valid != 0) {
        ans.push_back(par[first_valid]);
        first_valid = first_valid - w[par[first_valid]];
    }
    // for (auto &el : ans) {
    //     cout << el << " ";
    // }
    // cout << "\n";
    return ans;
}
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... | ||||
