| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1007930 | teesla | Detecting Molecules (IOI16_molecules) | C++14 | 37 ms | 65536 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> ww) {
    vector<pair<int,int>> w;
    for(int i=0; i<ww.size(); i++){
        w.push_back({ww[i], i});
    }
    sort(w.begin(), w.end());
    vector<int> res;
    int i = 1, f = w.size();
    while(i<=f){
        int meio = (i+f)/2;
        
        int soma = 0;
        for(int j=1; j<=meio; j++) soma += w[w.size()-j].first;
        if(soma < l){i = meio + 1; continue;}
        soma = 0;
        for(int j=0; j<meio; j++) {soma += w[j].first; res.push_back(w[j].second);}
        if(soma > u){f = meio-1;res.clear(); continue;}
        for(int j = 0; j<= meio; j++){
            if(soma >= l and soma <=u) return res;
            soma -= w[j].first;
            soma += w[j+meio].first;
            res[j] = w[j+meio].second;
        }
    }
    return res;
}
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... | ||||
