Submission #645956

#TimeUsernameProblemLanguageResultExecution timeMemory
645956Trisanu_DasDetecting Molecules (IOI16_molecules)C++17
100 / 100
46 ms4488 KiB
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> find_subset(int l,int u,vector <int> w) {
    int n=w.size();
    pair <int,int> a[n];
    for (int i=0; i<n; i++) a[i]={w[i],i};
    sort(a,a+n);
    int st=0;
	long long sum=0;
	for (int i=0; i<n; i++){
		sum+=a[i].first;
		while (sum>u) sum-=a[st++].first;
		if (sum>=l){
			vector <int> ans;
			for (int j=st; j<=i; j++) ans.push_back(a[j].second);
			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...