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>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int nbMolecules = w.size();
vector<pair<int, int>> wTrie(nbMolecules);
for(int i = 0; i < nbMolecules; i++)
{
wTrie[i] = {w[i], i};
}
sort(wTrie.begin(), wTrie.end());
queue<pair<int, int>> dansBon;
int iMol = nbMolecules;
//int iAEnlever = nbMolecules-1;
long long somme = 0;
while(iMol > 0)
{
iMol--;
somme += wTrie[iMol].first;
dansBon.push(wTrie[iMol]);
// cout << somme << endl;
if(somme >= l)
{
if(somme <= u)
{
vector<int> res;
while(dansBon.size())
{
res.push_back(dansBon.front().second);
dansBon.pop();
}
return res;
}
else
{
somme -= dansBon.front().first;
dansBon.pop();
}
}
}
return std::vector<int>();
}
# | 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... |