Submission #283077

#TimeUsernameProblemLanguageResultExecution timeMemory
283077sofapudenDetecting Molecules (IOI16_molecules)C++14
10 / 100
1 ms384 KiB
#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;
typedef long long ll;

vector<int> find_subset(int l, int u, vector<int> w) {
	int n = w.size();
	vector<pair<int,int>> v(n);
	vector<int> out;
	for(int i = 0; i < n; ++i){
		v[i].first =  w[i];
		v[i].second = i;
	}
	sort(v.begin(), v.end());
	int le = 0, ri = n-1;
	int sum = v[n-1].first;
	while(le < ri){
		while(sum < l && le < ri){
			sum+=v[--ri].first;
		}
		while(sum > u && le < ri){
			sum+=v[le].first;
			le++;
			sum-=v[n-le].first;
		}
		if(sum <= u && sum >= l){
			for(int i = 0; i < le; ++i){
				out.push_back(v[i].second);
			}
			for(int i = n-1-le; i>= ri; --i){
				out.push_back(v[i].second);
			}
			return out;
		}
	}	
	
    return vector<int>(0);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...