Submission #1064559

#	Time	Username	Problem	Language	Result	Execution time	Memory
1064559		Rigobertus	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	348 KiB

molecules

    #include <iostream>
    #include <algorithm>
    #include <vector>
    #include <map>
    #include <set>
    #include "molecules.h"
    using namespace std;
     
    vector<int> find_subset(int l, int u, vector<int> w) {
        int n = w.size();
        vector<pair<long long, int>> v;
        vector<int> result;
        for (int i = 0; i < n; i++) {
            v.push_back({ w[i], i + 1 });
        }
        sort(w.begin(), w.end());
        long long sum = 0;
        for (int i = 0; i < n; i++) {
            sum += w[i];
        }
        for (int i = n - 1; i >= 0; i--) {
            if (sum - v[i].first < l) {
                result.push_back(v[i].second);
            }
            else {
                sum -= v[i].first;
            }
        }
        if (sum < l || sum > u) {
            return {};
        }
        sort(result.begin(), result.end());
        return result;
    }

• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31