| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1235714 | coco2311 | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 332 KiB | 
#include "molecules.h"
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
#define f first
#define s second
#define ll long long
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    ll N=w.size();
    pair<ll,ll> arr[N];
    for(int i=0;i<N;i++){
        arr[i].f=w[i];
        arr[i].s=i;
    }
    sort(arr,arr+N);
    ll sum=0;
    ll it=N;
    for(int i=N-1;i>=0;i--){
        it=i;
        sum+=arr[i].f;
        if(sum>=l){
            break;
        }
    }
    if(it == 0 && sum<l){
        return vector<int> (0);
    }
    ll x=N-1;
    while(it>=0){
        if(sum>=l && sum<=u){
            vector<int> v;
            for(int i=it;i<=x;i++){
                v.push_back(arr[i].s);
            }
            return v;
        }
        sum-=arr[x].f;
        sum+=arr[it].f;
        it--;
        x--;
    }
    return 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... | ||||
