Submission #588268

#TimeUsernameProblemLanguageResultExecution timeMemory
588268haxormanDetecting Molecules (IOI16_molecules)C++14
0 / 100
1 ms212 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();

    int sum = 0;
    vector<pair<int,int>> vec;
    for (int i = 0; i < n; ++i) {
        sum += w[i];
        vec.push_back({w[i], i + 1});
    }
    sort(vec.begin(), vec.end(), greater<pair<int,int>>());

    while (sum > u && vec.size()) {
        sum -= vec.back().first;
        vec.pop_back();
    }

    if (sum > u || sum < l) {
        return {};
    }
    else {
        vector<int> ans;
        for (auto p : vec) {
            ans.push_back(p.second);
        }
        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...