| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 73717 | Hoget157 | Detecting Molecules (IOI16_molecules) | C++14 | 70 ms | 5548 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>
#define ll long long
using namespace std;
typedef pair<int,int> P;
vector<int> find_subset(int l, int u, std::vector<int> w) {
	vector<P> vec;
	int n = w.size();
	for(int i = 0;i < n;i++) vec.push_back(P(w[i],i));
	sort(vec.begin(),vec.end());
	vector<int> ans;
	ll s = 0;
	for(int i = 0;i < n;i++){
		s += vec[n - i - 1].first;
		ans.push_back(vec[n - i - 1].second);
		if(l <= s && s <= u) return ans;
		if(s > u) break;
	}
	if(s < l) return vector<int>(0);
	reverse(ans.begin(),ans.end());
	for(int i = 0;i < ans.size();i++){
		s = s - w[ans[i]] + vec[i].first;
		ans[i] = vec[i].second;
		if(l <= s && s <= u) 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... | ||||
