| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1218525 | islam_2010 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB | 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size(), sum = 0;
    vector<pair<int, int>> a(n);
    for (int i = 0; i < n; ++i) a[i] = {w[i], i};
    
    sort(a.begin(), a.end());
    vector<int> res;
    for (int d = 0; d < 2; ++d) {
        sum = 0, res.clear();
        for (int i = (d ? n - 1 : 0); (d ? i >= 0 : i < n); i += (d ? -1 : 1)) {
            if (sum + a[i].first > u) continue;
            sum += a[i].first;
            res.push_back(a[i].second);
            if (sum >= l) return res;
        }
    }
    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... | ||||
