Submission #840183

#	Time	Username	Problem	Language	Result	Execution time	Memory
840183		sleepntsheep	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	340 KiB

molecules

#include <algorithm>
#include <set>
#include <deque>

std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
    std::sort(w.begin(), w.end());
    int s = 0, i;
    std::multiset<int> sub;
    std::deque<int> lo, hi;
    for (i = 0; i < (int)w.size(); ++i) if (s + w[i] < l) s += w[i], lo.push_back(w[i]), sub.insert(i); else break;
    for (int j = i; j < (int)w.size(); ++j) hi.push_back(w[j]);
    std::reverse(hi.begin(), hi.end());
    while (s < l && lo.size() && hi.size())
    {
        int d = hi.front() - lo.front();
        s += d;
        sub.erase(sub.find(lo.front())); sub.insert(hi.front()); hi.pop_front(); lo.pop_front(); 
    }
    if (s < l) return std::vector<int>();
    std::vector<int> result(sub.begin(), sub.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