Submission #517197

#TimeUsernameProblemLanguageResultExecution timeMemory
517197tincamateiDetecting Molecules (IOI16_molecules)C++14
9 / 100
1 ms284 KiB
#include "molecules.h"

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int taken = 0, sum = 0;
    int n = w.size();
    
    std::vector<int> res;
    
    // adăugăm obiecte pe rând până când suma devine mai mare decât l
    while (taken < n && sum < l) {
        res.push_back(taken);
        sum += w[taken];
        taken++;
    }
    
    if (l <= sum && sum <= u)
        return res;
    
    // dacă nu am găsit soluție, returnăm un vector gol
    return std::vector<int>();
}
#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...