Submission #409609

#	Time	Username	Problem	Language	Result	Execution time	Memory
409609		DBPhoenix	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	256 KiB

molecules

#include <bits/stdc++.h>

using namespace std;

#include "molecules.h"

std::vector<int> find_subset(int l, int u, vector<int> w) {
    sort(w.begin(), w.end());

    int n = w.size();
    int length = 0;
    long long sum = 0;
    for (; length < n; length++)
    {
        if (sum + w[length] <= u) {
            sum += w[length];
        } else break;
    }

    vector<int> result(length);

    for (int i = 0; i < length; i++) {
        result[i] = w[i];
    }

    if (sum >= l) {
        return result;
    }

    for (int i = length - 1; i >= 0; i--)
    {
        sum -= result[i];
        result[i] = w[n - length + i];
        sum += result[i];

        if (sum >= l) {
            return result;
        }
    }

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

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