| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1165374 | spycoderyt | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB | 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int r, std::vector<int> w) {
    sort(w.begin(),w.end());
    vector<int> ans;
    int sum = 0;
    int n = w.size();
    int idx = 0;
    for(int i = 0;i<n;i++) {
        sum+=w[i];
        idx=i;
        if(sum >= l && sum <= r) {
            for(int j = 0;j<=i;j++)ans.push_back(j);
            return ans;
        } else if (sum > r) {
            sum -= w[i];
            idx--;
            break;
        }
    }
    sum += w[n-1] - w[0];
    if(sum >= l && sum <= r) {
        for(int i = 1;i<=idx;i++)ans.push_back(i);
        ans.push_back(n-1);
        return ans;
    }
    return std::vector<int>(0);
}
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... | ||||
