Submission #319350

#TimeUsernameProblemLanguageResultExecution timeMemory
319350barsboldDetecting Molecules (IOI16_molecules)C++14
0 / 100
1 ms364 KiB
#include "molecules.h"
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
using namespace std;

std::vector<int> find_subset(int L, int u, std::vector<int> w) {
	int n = w.size();
	vector<pair<int , int >> vi;
	for(int i = 0 ; i< n; i++){
		vi.pb(mp(w[i],i));	
	}

	sort(vi.begin(), vi.end());
	
	int l =0;
	int r = 0;
	long long sum = vi[0].first;
	vector<int > ans;
	while(r <n){
		while(sum >u && l<=r){
			sum-=vi[l].first;
			l++;
		}
		if(sum >= L){
			for(int i = l; i<=r; i++){
				ans.push_back(vi[i].second);
			}
			break;
		}
		r++;
	}
	if(!ans.size()){
		ans.push_back(0);
	}
	return ans;
}
#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...