Submission #867282

#	Time	Username	Problem	Language	Result	Execution time	Memory
867282		AtabayRajabli	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	78 ms	12904 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

std::vector<int> find_subset(int L, int U, std::vector<int> w) {
    int n = w.size();
    std::vector<pair<int, int>> v(n);

    for(int i = 0; i<n; i++)
    {
        v[i] = make_pair(w[i], i);
    }
    sort(v.begin(), v.end());
    set<int> s;

    int l = 0, r = 0, sum = 0;

    while(r < n)
    {
        sum += v[r].first;
        s.insert(v[r].second);
        while(l <= r && sum > U)
        {
            sum -= v[l].first;
            s.erase(v[l].second);
            l++;
        }
        if(L <= sum && sum <= U)
        {
            vector<int> ans;
            for(int i : s)ans.push_back(i);
            return ans;
        }
        r++;
    }

    return std::vector<int>(0);
}

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