Submission #380365

#TimeUsernameProblemLanguageResultExecution timeMemory
380365ritul_kr_singhDetecting Molecules (IOI16_molecules)C++17
100 / 100
64 ms6256 KiB
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
 
vector<int> find_subset(int lx, int ux, vector<int> w){
  	using ll = long long;
  	ll l = lx, u = ux;
	vector<pair<ll, ll>> a;
	int curr = 0;
	ll _sum = 0, n = w.size();
	for(int i : w) a.emplace_back(i, curr++), _sum += (ll)i;
	sort(a.begin(), a.end());
	ll sum = _sum;
	int j = 0;
	for(int i=-1; i<n; ++i){
		if(i>=0) sum += a[i].first;
		while(j<=i) sum -= a[j++].first;
		while(j<n and sum>u) sum -= a[j++].first;
		if(l<=sum and sum<=u){
			vector<int> ans;
			for(int k=0; k<=i; ++k) ans.push_back(a[k].second);
			for(int k=n-1; k>=j; --k) ans.push_back(a[k].second);
			sort(ans.begin(), ans.end());
			return ans;
		}
	}
	return {};
}
#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...