| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1226781 | Jer | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 328 KiB | 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10005;
int pre[MAXN];
int n;
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
    n = w.size();
    vector<pair<int, int>> a;
    for (int i = 0; i < n; i++)
        a.push_back({w[i], i});
    sort(a.begin(), a.end());
    for (int i = 0; i < n; i++)
        pre[i] = (i == 0) ? a[0].first : a[i].first + pre[i - 1];
    for (int i = 0; i < n; i++)
    {
        int *s = lower_bound(pre, pre + n, l + pre[i]);
        int sum = pre[i] + *s;
        if (sum >= l and sum <= u)
        {
            vector<int> res;
            for (int j = (s - pre) - i - 1; j < (s - pre); j++)
                res.push_back(a[j].second);
            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... | ||||
