제출 #536450

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
536450		timreizin	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	1086 ms	6532 KiB

molecules

#include "molecules.h"
#include <algorithm>

using namespace std;

using ll = long long;

vector<int> find_subset(int l, int u, vector<int> w)
{
    int n = w.size();
    vector<pair<ll, int>> a(n);
    for (int i = 0; i < n; ++i) a[i] = {w[i], i};
    sort(a.begin(), a.end());
    for (int i = 0; i < n; ++i)
    {
        ll sum = 0;
        vector<int> res;
        for (int j = i; j < n; ++j)
        {
            sum += a[j].first;
            res.push_back(a[j].second);
            if (sum >= l && sum <= u) return res;
        }
    }
    return 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