제출 #840201

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
840201		sleepntsheep	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	53 ms	6476 KiB

molecules

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

std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
    int n = w.size();
    std::vector<int> rvcord(n);
    {
        std::vector<std::pair<int, int>> incw(n);
        for (int i = 0; i < n; ++i) incw[i] = {w[i], i};
        std::sort(incw.begin(), incw.end());
        for (int i = 0; i < n; ++i) rvcord[i] = incw[i].second;
        std::sort(w.begin(), w.end());
    }
    std::sort(w.begin(), w.end());
    long long s = 0, i;
    std::deque<int> lo, hi;
    for (i = 0; i < (int)w.size(); ++i)
        if (s + w[i] <= u) s += w[i], lo.push_back(i);
        else break;
    for (int j = i; j < (int)w.size(); ++j) hi.push_front(j);
    while (s < l && lo.size() && hi.size())
    {
        long long d = w[hi.front()] - w[lo.front()];
        if (d <= 0) break;
        s += d;
        lo.push_back(hi.front());
        hi.pop_front(); lo.pop_front(); 
    }
    if (s < l) return std::vector<int>();
    std::vector<int> result(lo.begin(), lo.end());
    for (auto &x : result) x = rvcord[x];
    return result;
}

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