| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 59064 | Bodo171 | Detecting Molecules (IOI16_molecules) | C++14 | 81 ms | 31712 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 <vector>
#include <algorithm>
using namespace std;
vector< pair<int,int> >v;
vector<int> ans;
int i,p,j;
vector<int> find_subset(int l, int u, std::vector<int> w) {
    for(i=0;i<w.size();i++)
    {
        v.push_back({w[i],i});
    }
    long long L=l,U=u,sum=0;
    sort(v.begin(),v.end());
    p=0;
    for(i=0;i<v.size();i++)
    {
        sum+=v[i].first;
        while(p<i&&sum>U)
        {
            sum-=v[p].first;
            p++;
        }
        if(sum>=L&&sum<=U)
        {
            for(j=p;j<=i;j++)
                ans.push_back(v[j].second);
            sort(ans.begin(),ans.end());
            return ans;
        }
    }
    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... | ||||
