| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 134064 | junodeveloper | Detecting Molecules (IOI16_molecules) | C++14 | 184 ms | 18180 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;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	vector<pair<int,int> > a;
	int i;
	for(i=0;i<w.size();i++) a.push_back({w[i],i});
	sort(a.begin(),a.end());
	set<pair<long long,int> > st;
	long long sum=0;
	st.insert({0,-1});
	for(i=0;i<a.size();i++) {
		sum+=a[i].first;
		auto it=st.lower_bound({sum-u,-1});
		if(it!=st.end()) {
			if(it->first<=sum-l) {
				vector<int> ans;
				for(int j=it->second+1;j<=i;j++) ans.push_back(a[j].second);
				return ans;
			}
		}
		st.insert({sum,i});
	}
	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... | ||||
